#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
#include <bitset>
using namespace std;

#define LEN 100000

int main(){
	int n,q;
	cin >> n >> q;
	long long ans_a = 0;
	long long ans_b = 0;

	bitset<LEN> a;
	bitset<LEN> b;
	bitset<LEN> mask;
	for(int i=0; i<q; i++){
		int x,l,r;
		cin >> x >> l >> r;

		mask.reset();
		mask.flip();
		int d = LEN - (r+1 - l);
		mask >>= d;
		mask <<= l;

		if(x==0){
			int cnt_a = (a & mask).count();
			int cnt_b = (b & mask).count();

			if(cnt_a == cnt_b) continue;
			(cnt_a>cnt_b?ans_a:ans_b) += max(cnt_a, cnt_b);

		}else{
			if(x==1){
				a |= mask;
				mask.flip();
				b &= mask;
			}else{
				b |= mask;
				mask.flip();
				a &= mask;
			}
		}
	}


	int cnt_a = a.count();
	int cnt_b = b.count();

	ans_a += cnt_a;
	ans_b += cnt_b;

	cout << ans_a << " " << ans_b << endl;
	return 0;
}