#include <stdio.h>
#include <stdlib.h>

typedef struct {
	int b;
	int w;
	int rank;
} cell;
	
int main(void) 
{	
	int i, j, n, m;
	scanf("%d %d", &n, &m);
	
	cell *v = malloc(n * sizeof(cell));
	for (i = 0; i < n; i++) {
		scanf("%d %d", &v[i].b, &v[i].w);
		v[i].rank = v[i].b - v[i].w;
	}
	for (i = 0; i < n - 1; i++) {
		cell max = v[i];
		for (j = i + 1; j < n; j++) {
			if (v[j].rank > max.rank) {
				max = v[j];
				v[j] = v[i];	
				v[i] = max;
			}
		}
	}
	int sum_b = 0, sum_w = 0;
	for (i = 0; i < n / 2; i++) {
		sum_b += v[i].b;
	}
	for (i = n / 2; i < n; i++) {
		sum_w += v[i].w;
	}
	printf("%d %d", sum_b, sum_w);
	
	free(v);	
	return 0;
}