#include <iostream>

using namespace std;
void merge(int arr[], int l, int m, int r)
{
    int i, j, k;
    int n1 = m - l + 1;
    int n2 =  r - m;

    /* create temp arrays */
    int L[n1], R[n2];

    /* Copy data to temp arrays L[] and R[] */
    for(i = 0; i < n1; i++)
        L[i] = arr[l + i];
    for(j = 0; j < n2; j++)
        R[j] = arr[m + 1+ j];

    /* Merge the temp arrays back into arr[l..r]*/
    i = 0;
    j = 0;
    k = l;
    while (i < n1 && j < n2)
    {
        if (L[i] >= R[j])
        {
            arr[k] = L[i];
            i++;
        }
        else
        {
            arr[k] = R[j];
            j++;
        }
        k++;
    }

    /* Copy the remaining elements of L[], if there are any */
    while (i < n1)
    {
        arr[k] = L[i];
        i++;
        k++;
    }

    /* Copy the remaining elements of R[], if there are any */
    while (j < n2)
    {
        arr[k] = R[j];
        j++;
        k++;
    }
}

/* l is for left index and r is right index of the sub-array
  of arr to be sorted */
void mergeSort(int arr[], int l, int r)
{
    if (l < r)
    {
        int m = l+(r-l)/2; //Same as (l+r)/2, but avoids overflow for large l and h
        mergeSort(arr, l, m);
        mergeSort(arr, m+1, r);
        merge(arr, l, m, r);
    }
}
int main()
{
    int N,M,i,sw=0,sb=0;
    cin>>N>>M;
    if(N%2!=0){return 0;}
    int A[N][2];
    if(1<=N && N<=100000 && 1<=M && M<=100000){
        for(i=0;i<N;i++){
            cin>>A[i][0]>>A[i][1];
            if(A[i][0]+A[i][1]!=M||A[i][0]<0 || A[i][1]<0 || A[i][0]>10000||A[i][1]>10000 ){return 0;}
        }
    }
    int a[N];
    for(i=0;i<N;i++){
        a[i]=A[i][0];
    }
    mergeSort(a,0,N-1);
    for(i=0;i<N/2;i++){
        sw+=a[i];
    }
    for(i=N/2;i<N;i++){
        sb+=M-a[i];
    }
    cout<<sb<<" "<<sw;
    return 0;
}