#include <bits/stdc++.h>
using namespace std;

int in() {
	int t;
	scanf("%d", &t);
	return t;
}

struct RSQ {
	// (k level decomposition)
	static const int L = 4;
	static const int S = 18;

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

	Tuple dat[L][S * S * S * S];

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

	void push(int k) {
		for (int i = 0; i < L - 1; i++) {
			int s = 1;
			for (int j = 0; j < L - i - 1; j++) {
				s *= S;
			}
			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;
			}
		}
	}

	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;
				for (int j = b * S; j < b * S + S; j++) {
					dat[i][b].sum += dat[i + 1][j].sum;
				}
			}
			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);
	}

	int query(int l, int r) {
		push(l);
		push(r - 1);
		int ret = 0;
		for (int i = L - 1; i >= 0; i--) {
			while (l < r && l % S != 0) ret += dat[i][l++].sum;
			while (l < r && r % S != 0) ret += dat[i][--r].sum;
			l /= S;
			r /= S;
		}
		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;
}