#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include <bits/stdc++.h>
using namespace std;
#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 {
	// (sqrt level decomposition)
	static const int S = 345;

	struct Tuple {
		int sum = 0;
		int lazy = -1;
	};

	Tuple L1[S];
	int L2[S * S * S];

	void setLazy(int k, int v) {
		L1[k].lazy = v;
		L1[k].sum = v * S;
	}

	void push(int k) {
		int b = k / S;
		if (L1[b].lazy != -1) {
			for (int i = b * S; i < b * S + S; i++) {
				L2[i] = L1[b].lazy;
			}
			L1[b].lazy = -1;
		}
	}

	void fix(int k) {
		int b = k / S;
		if (L1[b].lazy == -1) {
			L1[b].sum = 0;
			for (int i = b * S; i < b * S + S; i++) {
				L1[b].sum += L2[i];
			}
		}
	}

	void fill(int l, int r, int k) {
		int ll = l;
		int rr = r - 1;
		push(l);
		push(r - 1);
		while (l < r && l % S != 0) L2[l++] = k;
		while (l < r && r % S != 0) L2[--r] = k;
		l /= S;
		r /= S;
		while (l < r && l % S != 0) setLazy(l++, k);
		while (l < r && r % S != 0) setLazy(--r, k);
		fix(ll);
		fix(rr);
	}

	int query(int l, int r) {
		push(l);
		push(r - 1);
		int ret = 0;
		while (l < r && l % S != 0) ret += L2[l++];
		while (l < r && r % S != 0) ret += L2[--r];
		l /= S;
		r /= S;
		while (l < r) ret += L1[l++].sum;
		return ret;
	}
};

RSQ rsq[2];

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 a = rsq[0].query(l, r);
			int b = rsq[1].query(l, r);
			if (a > b) scoreA += a;
			if (a < b) scoreB += b;
		} else {
			rsq[x ^ 0].fill(l, r, 1);
			rsq[x ^ 1].fill(l, r, 0);
		}
	}
	scoreA += rsq[0].query(0, n);
	scoreB += rsq[1].query(0, n);
	cout << scoreA << " " << scoreB << endl;
}