#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
int n,m,b,w;
int white[100001],black[100001];

void mergesort(int st,int dr)
{
    if(dr-st<=1){if(white[st]<white[dr])swap(white[st],white[dr]);  }
    else{
        int m=(st+dr)/2;
        mergesort(st,m);
        mergesort(m+1,dr);
        int i=st,j=m+1,d=st-1;
        while(i<=m && j<=dr)
        {
            if(white[i]>white[j]){ d++; black[d]=white[i]; i++;   }
            else {d++; black[d]=white[j]; j++; }
        }
        while(i<=m){ d++; black[d]=white[i]; i++; }
        while(j<=dr){d++; black[j]=white[j]; j++; }
        for(int i=st; i<=dr; i++)white[i]=black[i];

    }

}


int main()
{
//freopen("date.in","r",stdin);
//freopen("date.out","w",stdout);
cin>>n>>m;
for(int i=1; i<=n; i++)cin>>white[i]>>black[i];
//for(int i=1; i<=n; i++)cout<<white[i]<<endl;
mergesort(1,n);

for(int i=n/2+1; i<=n; i++){ b=b+m-white[i]; }
for(int i=1; i<=n/2; i++){ w+=white[i]; }
cout<<b<<" "<<w;

    return 0;
}