#include<iostream> #include<algorithm> using namespace std; int main() { int n,m,i,cnt; cin>>n>>m; short w[n]; for(i=0;i<n;i++) cin>>w[i]>>cnt; sort(w,w+n); //negre n>>=1; cnt=n*m; for(i=0;i<n;i++) cnt-=w[i]; cout<<cnt<<" "; n<<=1; cnt=0; //albe for(i=n/2;i<n;i++) cnt+=w[i]; cout<<cnt; return 0; }