#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001
#define sz 300

int main(){
	
	int N,Q;
	cin>>N>>Q;
	
	vector<int> a(N,0);
	int cnt = (N+sz-1)/sz;
	vector<int> lazy(cnt,0);
	vector<int> Ac(cnt,0),Bc(cnt,0);
	
	long long A=0,B=0;
	int X = 0;
	rep(_,Q){
		int x,l,r;
		scanf("%d %d %d",&x,&l,&r);
	
	/*if(_==0)x = 1;
	else x = 0;
		l = 0;
		r = 99999;
		*/
		if(x==0){
			int AA = 0,BB = 0;
			while(l<=r){
				
				if(l%sz!=0 || l+sz>r){
					int rr;
					rr = ((l+sz)/sz)*sz-1;
					if(rr>r)rr = r;
				//	cout<<l<<','<<rr<<endl;
					for(int i=l;i<=rr;i++){
						X++;
						if(lazy[i/sz]==1||(lazy[i/sz]==0&&a[i]==1))AA++;
						if(lazy[i/sz]==2||(lazy[i/sz]==0&&a[i]==2))BB++;
					}
					l = rr+1;
				}
				else{
					AA += Ac[l/sz];
					BB += Bc[l/sz];
					l += sz;
				}
			}
			if(AA>BB)A += AA;
			if(AA<BB)B += BB;
		}
		else{
			while(l<=r){
				
				if(l%sz!=0 || l+sz>r){
					int rr;
					rr = ((l+sz)/sz)*sz-1;
					if(rr>r)rr = r;
					
					if(lazy[l/sz]!=0){
						for(int i=(l/sz)*sz;i<min(N,(l/sz)*sz+sz);i++){
							a[i] = lazy[l/sz];
						}
						lazy[l/sz] = 0;
					}
					//cout<<l<<','<<rr<<endl;
					for(int i=l;i<=rr;i++)a[i] = x;
					Ac[l/sz] = 0;
					Bc[l/sz] = 0;
					for(int i=(l/sz)*sz;i<min(N,(l/sz)*sz+sz);i++){
						if(a[i]==1)Ac[l/sz]++;
						if(a[i]==2)Bc[l/sz]++;
					}
					l = rr+1;
				}
				else{
					//cout<<l/sz<<endl;
					lazy[l/sz] = x;
					Ac[l/sz] = 0;
					Bc[l/sz] = 0;
					int t = min(N,l+sz) - l;
					//cout<<t<<endl;
					if(x==1)Ac[l/sz] = t;
					else Bc[l/sz] = t;
					l += sz;
				}
			}
		}
	}
	
	rep(i,cnt){
		A += Ac[i];
		B += Bc[i];
	}
	//cout<<X<<endl;
	cout<<A<<' '<<B<<endl;
	
	return 0;
}