#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
#include "assert.h"
using namespace std;

int main(){
	int n,q;
	cin >> n >> q;

	int SZ = sqrt(n)+1e-9;
	vector<vector<int>> bucket_sum(2, vector<int>(SZ+2, 0));
	vector<int> lazy(SZ+2, 0);
	vector<vector<vector<int>>> bucket(2, vector<vector<int>>(SZ+2, vector<int>(SZ, 0)));
	long long ans_a = 0;
	long long ans_b = 0;

	auto push = [&](int l, int r){
		for(int k : {l/SZ, r/SZ}){
			if(lazy[k] != 0){
				for(int j=0; j<SZ; j++){
					bucket[0][k][j] = (lazy[k] == 1?1:0);
					bucket[1][k][j] = (lazy[k] == 2?1:0);
				}
				bucket_sum[0][k] = (lazy[k]==1?SZ:0);
				bucket_sum[1][k] = (lazy[k]==2?SZ:0);
				lazy[k] = 0;
			}
		}
	};

	for(int i=0; i<q; i++){
		int x,l,r;
		cin >> x >> l >> r;

		if(x==0){
			int cnt_a = 0;
			int cnt_b = 0;

			for(int k=(l+SZ)/SZ; k<r/SZ; k++){
				cnt_a += bucket_sum[0][k];
				cnt_b += bucket_sum[1][k];
			}

			push(l,r);

			int k = l/SZ;
			for(int j=l%SZ, ub=(l/SZ!=r/SZ ? SZ:r%SZ+1); j<ub; j++){
				cnt_a += bucket[0][k][j];
				cnt_b += bucket[1][k][j];
			}

			if(l/SZ != r/SZ){
				k = r/SZ;
				for(int j=0; j<=r%SZ; j++){
					cnt_a += bucket[0][k][j];
					cnt_b += bucket[1][k][j];
				}
			}

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

		}else{

			for(int k=(l+SZ)/SZ; k<r/SZ; k++){
				bucket_sum[0][k] = (x==1?SZ:0);
				bucket_sum[1][k] = (x==2?SZ:0);
				lazy[k] = x;
			}
			push(l,r);

			int k = l/SZ;
			for(int j=l%SZ, ub=(l/SZ != r/SZ?SZ:r%SZ+1); j<ub; j++){
				bucket[0][k][j] = (x==1?1:0);
				bucket[1][k][j] = (x==2?1:0);
			}
			bucket_sum[0][k] = bucket_sum[1][k] = 0;
			for(int j=0; j<SZ; j++){
				bucket_sum[0][k] += bucket[0][k][j];
				bucket_sum[1][k] += bucket[1][k][j];
			}

			if(l/SZ != r/SZ){
				k = r/SZ;
				for(int j=0; j<=r%SZ; j++){
					bucket[0][k][j] = (x==1?1:0);
					bucket[1][k][j] = (x==2?1:0);
				}
				bucket_sum[0][k] = bucket_sum[1][k] = 0;
				for(int j=0; j<SZ; j++){
					bucket_sum[0][k] += bucket[0][k][j];
					bucket_sum[1][k] += bucket[1][k][j];
				}
			}

		}
	}

	int cnt_a = 0;
	int cnt_b = 0;

	int l=0, r=n-1;
	for(int k=(l+SZ)/SZ; k<r/SZ; k++){
		cnt_a += bucket_sum[0][k];
		cnt_b += bucket_sum[1][k];
	}

	push(l,r);

	int k = l/SZ;
	for(int j=l%SZ, ub=(l/SZ!=r/SZ?SZ:r%SZ+1); j<ub; j++){
		cnt_a += bucket[0][k][j];
		cnt_b += bucket[1][k][j];
	}

	if(l/SZ != r/SZ){
		k = r/SZ;
		for(int j=0; j<=r%SZ; j++){
			cnt_a += bucket[0][k][j];
			cnt_b += bucket[1][k][j];
		}
	}

	ans_a += cnt_a;
	ans_b += cnt_b;

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