#include<stdio.h>
#define MAX 100
typedef struct
{
    long int alb,negru;
}cutie;
void sort_negru(cutie cutii[100],long int nrCutii)
{
    cutie aux;
    long int i,j;
    for(i=1;i<=nrCutii-1;i++)
        for(j=i+1;j<=nrCutii;j++)
            if(cutii[i].negru<cutii[j].negru)
               {
                   aux=cutii[i];
                   cutii[i]=cutii[j];
                   cutii[j]=aux;
               }
}
void sort_alb(cutie cutii[MAX],long int nrCutii)
{
    cutie aux;
    long int i,j;
    for(i=1;i<=nrCutii-1;i++)
        for(j=i+1;j<=nrCutii;j++)
            if(cutii[i].alb<cutii[j].alb)
               {
                   aux=cutii[i];
                   cutii[i]=cutii[j];
                   cutii[j]=aux;
               }
}

int main()
{
    long int nrCutii,nrPlaci,c=0,k1=0,k2=0,i;
    cutie cutii[MAX],cutii1[MAX],cutii2[MAX];

    scanf("%ld %ld",&nrCutii,&nrPlaci);
    for(i=1;i<=nrCutii;i++)
        scanf("%ld %ld",&cutii[i].negru,&cutii[i].alb);

while(c<(nrCutii/2)){

    sort_negru(cutii,nrCutii);
    cutii1[++k1]=cutii[1];
    cutii[1].negru=-1;
    cutii[1].alb=-1;
    sort_alb(cutii,nrCutii);
    cutii2[++k2]=cutii[1];
    cutii[1].negru=-1;
    cutii[1].alb=-1;
    c++;
}
long int suma1=0,suma2=0;
for(i=1;i<=k1;i++)
        suma1=suma1+cutii1[i].negru;
for(i=1;i<=k2;i++)
        suma2=suma2+cutii2[i].alb;
printf("%ld %ld\n",suma1,suma2);
}