#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

struct unko {
	int c, l, r;
	unko(int _c, int _l, int _r) {
		c = _c; l = _l; r = _r;
	}
};

i_i f(int N, vector<int>& sumr, vector<int>& sumb, vector<unko>& v, int l, int r) {
	i_i p;
	for (int i = 0; i < v.size(); i++) {
		int _l = max(v[i].l, l), _r = min(v[i].r, r);
		if (_l >= _r) continue;
		if (v[i].c == 0) {
			p.first += sumr[_r] - sumr[_l];
			p.second += sumb[_r] - sumb[_l];
		}
		if (v[i].c == 1) p.first += _r - _l;
		if (v[i].c == 2) p.second += _r - _l;
	}
	return p;
}

int main() {
	int N, Q; cin >> N >> Q;
	vector<int> a(N), sumr(N + 1), sumb(N + 1);
	vector<unko> v;
	ll R = 0, B = 0;
	for (int q = 0; q < Q; q++) {
		if (q % 300 == 0) {
			for (int i = 0; i < v.size(); i++)
				for (int j = v[i].l; j < v[i].r; j++)
					if (v[i].c)
						a[j] = v[i].c;
			v.clear();
			v.push_back(unko(0, 0, N));
			for (int j = 1; j <= N; j++) {
				sumr[j] = sumr[j - 1];
				sumb[j] = sumb[j - 1];
				if (a[j - 1] == 1) sumr[j]++;
				if (a[j - 1] == 2) sumb[j]++;
			}
		}
		int x, l, r; scanf("%d%d%d", &x, &l, &r);
		r++;
		if (x == 0) {
			i_i p = f(N, sumr, sumb, v, l, r);
			if (p.first > p.second) R += p.first;
			if (p.first < p.second) B += p.second;
		}
		else {
			vector<unko> _v;
			for (int i = 0; i < v.size(); i++) {
				if (l <= v[i].l && v[i].r <= r) continue;
				if (v[i].l < l && r < v[i].r) {
					_v.push_back(unko(v[i].c, v[i].l, l));
					_v.push_back(unko(v[i].c, r, v[i].r));
				}
				else if (v[i].l < l)
					_v.push_back(unko(v[i].c, v[i].l, min(v[i].r, l)));
				else if (r < v[i].r)
					_v.push_back(unko(v[i].c, max(v[i].l, r), v[i].r));
			}
			_v.push_back(unko(x, l, r));
			v = _v;
		}
	}
	i_i p = f(N, sumr, sumb, v, 0, N);
	R += p.first;
	B += p.second;
	cout << R << ' ' << B << endl;
}