#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void quickSort(int arr[], int left, int right) {
      int i = left, j = right;
      int tmp;
      int pivot = arr[(left + right) / 2];
      while (i <= j) {
            while (arr[i] < pivot)
                  i++;
            while (arr[j] > pivot)
                  j--;
            if (i <= j) {
                  tmp = arr[i];
                  arr[i] = arr[j];
                  arr[j] = tmp;
                  i++;
                  j--;
            }
      };
      if (left < j)
            quickSort(arr, left, j);
      if (i < right)
            quickSort(arr, i, right);
}
//t.z.
int main()
{
    int n,m,tmp;
    int sB = 0;
    int sW = 0;
    cin >> n >> m;
    int b[n];
    for(int i = 0;i < n; ++i){
        cin >> tmp >> b[i];
    }
    quickSort(b,0,n-1);
    for(int j = 0;j < n/2; ++j){
        sW += m-b[j];
        sB += b[n-1-j];
    }
    cout << sW << " " << sB;
    return 0;
}