#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include <bits/stdc++.h>
#define getchar getchar_unlocked

int in() {
	int n;
	int c;
	while ((c = getchar()) < '0') if (c == EOF) return -1;
	n = c - '0';
	while ((c = getchar()) >= '0') n = n * 10 + c - '0';
	return n;
}

struct RSQ {
	static const int L = 4;
	static const int S = 18;

	// (k level decomposition)

	struct Tuple {
		int sum[2];
		int lazy;
	};

	Tuple pool[121212];
	Tuple *dat[L];

	RSQ() {
		for (int i = 0; i < 121212; i++) {
			pool[i].lazy = -1;
		}
		int k = 0;
		int s = S;
		for (int i = 0; i < L; i++) {
			dat[i] = &pool[k];
			k += s;
			s *= S;
		}
	}

	int power(int a, int b) {
		int ret = 1;
		for (int i = 0; i < b; i++) {
			ret *= a;
		}
		return ret;
	}

	void setLazy(int h, int k, int s, int v) {
		dat[h][k].sum[0] = s * (v ^ 1);
		dat[h][k].sum[1] = s * (v ^ 0);
		dat[h][k].lazy = v;
	}

	void push(int k) {
		int s = power(S, L - 1);
		for (int i = 0; i < L - 1; i++) {
			int b = k / s;
			if (dat[i][b].lazy != -1) {
				for (int j = b * S; j < b * S + S; j++) {
					setLazy(i + 1, j, s / S, dat[i][b].lazy);
				}
				dat[i][b].lazy = -1;
			}
			s /= S;
		}
	}

	void fix(int k) {
		int b = k / S;
		for (int i = L - 2; i >= 0; i--) {
			if (dat[i][b].lazy == -1) {
				dat[i][b].sum[0] = 0;
				dat[i][b].sum[1] = 0;
				for (int j = b * S; j < b * S + S; j++) {
					dat[i][b].sum[0] += dat[i + 1][j].sum[0];
					dat[i][b].sum[1] += dat[i + 1][j].sum[1];
				}
			}
			b /= S;
		}
	}

	void fill(int l, int r, int k) {
		int ll = l;
		int rr = r - 1;
		push(l);
		push(r - 1);
		int s = 1;
		for (int i = L - 1; i >= 0; i--) {
			while (l < r && l % S != 0) setLazy(i, l++, s, k);
			while (l < r && r % S != 0) setLazy(i, --r, s, k);
			l /= S;
			r /= S;
			s *= S;
		}
		fix(ll);
		fix(rr);
	}

	void query(int l, int r, int &ret0, int &ret1) {
		push(l);
		push(r - 1);
		ret0 = ret1 = 0;
		for (int i = L - 1; i >= 0; i--) {
			while (l < r && l % S != 0) {
				ret0 += dat[i][l].sum[0];
				ret1 += dat[i][l].sum[1];
				l++;
			}
			while (l < r && r % S != 0) {
				r--;
				ret0 += dat[i][r].sum[0];
				ret1 += dat[i][r].sum[1];
			}
			l /= S;
			r /= S;
		}
	}
};

RSQ rsq;

int main() {
	int n = in();
	int q = in();

	long long scoreA = 0;
	long long scoreB = 0;
	while (q--) {
		int x = in() - 1;
		int l = in();
		int r = in() + 1;
		if (x == -1) {
			int s, t;
			rsq.query(l, r, s, t);
			if (s > t) scoreA += s;
			if (s < t) scoreB += t;
		} else {
			rsq.fill(l, r, x);
		}
	}
	int s, t;
	rsq.query(0, n, s, t);
	scoreA += s;
	scoreB += t;
	printf("%lld %lld\n", scoreA, scoreB);
}