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

//struct node{
//	int stay,l,r;
//}a[105];

int vis[105];
int a[105];
int L,n,sap,dcut;

int main(){
	memset(a,1,sizeof(a));
	memset(vis,0,sizeof(vis));
	cin >> L >> n;
	for(int i = 1;i <= n;i++){
		int num,l,r;
		cin >> num >> l >> r/*>> a[i].stay >> a[i].l >> a[i].r*/;
		if(num == 0){
			for(int j = l;j <= r;j++){
				vis[j]++;
				a[j] = 0;
			}
		}else if(num == 1){
			for(int j = l;j <= r;j++){
				vis[j]++;
				a[j] = 1;
			}
		}
	}
	for(int i = 0;i <= L;i++){
		if(a[i] == 0 && vis[i] == 3){
			dcut++;
		}else if(a[i] == 1 && vis[i] == 2){
			sap++;
		}  
	}
	cout << sap << "\n" << dcut;
}