import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.NoSuchElementException;

class SlidingQueue {
	
	class Pair {
		long v,cnt;
		
		public Pair(long v,long cnt) {
			this.v=v;
			this.cnt=cnt;
		}
	}
	
	int sz=0;
	Deque<Pair> st=new ArrayDeque<>();
	final long INF=Long.MAX_VALUE/3;
	
	
	void push(long v) {
		int cnt=1;
		while (!st.isEmpty() && st.peekLast().v <= v) {
			cnt+=st.peekLast().cnt;
			st.pollLast();
		}
		st.addLast(new Pair(v,cnt));
		++sz;
	}
	
	void pop() {
		st.peekFirst().cnt--;
		if (st.peekFirst().cnt==0) st.pollFirst();
		--sz;
	}
	
	long max() {
		if (st.isEmpty()) {
			return -INF;
		} else {
			return st.peekFirst().v;
		}
	}
}

public class Main {

	public static void main(String[] args) {
		new Main().run();
	}
	
	class SegTree {
		int n=1;
		int[] lazy;
		int[] a;
		int[] b;
		
		public SegTree(int n_) {
			while (n<n_) n*=2;
			a=new int[2*n-1];
			b=new int[2*n-1];
			lazy=new int[2*n-1];
		}
		
		void push(int l,int r,int k) {
			if (lazy[k]==0) return;
			a[k]=(r-l)*Math.max(lazy[k],0);
			b[k]=(r-l)*Math.min(lazy[k],0);
			if (2*k+1<n) {
				lazy[2*k+1]=lazy[k];
				lazy[2*k+2]=lazy[k];
			}
			lazy[k]=0;
		}
		
		int[] query(int a,int b,int upd) {
			return query(0,n,a,b,0,upd);
		}
		
		int[] query(int l,int r,int s,int t,int k,int upd) {
			push(l,r,k);
			if (r<=s||t<=l) return new int[] {0,0};
			else if (s<=l&&r<=t) {
				lazy[k]=upd;
				push(l,r,k);
				return new int[] {a[k],b[k]};
			} else {
				int[] vl=query(l,(l+r)/2,s,t,2*k+1,upd);
				int[] vr=query((l+r)/2,r,s,t,2*k+2,upd);
				a[k]=a[2*k+1]+a[2*k+2];
				b[k]=b[2*k+1]+b[2*k+2];
				return new int[] {vl[0]+vr[0],vl[1]+vr[1]};
			}
		}
	}
	
	void run() {
		FastScanner sc=new FastScanner();
		int N=sc.nextInt();
		int Q=sc.nextInt();
		SegTree seg=new SegTree(N);
		int a=0,b=0;
		for (int q=0;q<Q;++q) {
			int x=sc.nextInt();
			int l=sc.nextInt();
			int r=sc.nextInt();
			if (x==0) {
				int[] v=seg.query(l, r+1, 0);
				int pt=v[0]+v[1];
				if (pt>0) a+=pt;
				else b+=pt;
			} else if (x==1) {
				seg.query(l, r+1, +1);
			} else {
				seg.query(l, r+1, -1);
			}
		}
		a+=seg.query(0, N, 0)[0];
		b+=seg.query(0, N, 0)[1];
		System.out.println(a+" "+(-b));
	}
	
	void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
	
	
	class FastScanner {
	    private final InputStream in = System.in;
	    private final byte[] buffer = new byte[1024];
	    private int ptr = 0;
	    private int buflen = 0;
	    private boolean hasNextByte() {
	        if (ptr < buflen) {
	            return true;
	        }else{
	            ptr = 0;
	            try {
	                buflen = in.read(buffer);
	            } catch (IOException e) {
	                e.printStackTrace();
	            }
	            if (buflen <= 0) {
	                return false;
	            }
	        }
	        return true;
	    }
	    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	    private boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
	    public boolean hasNext() { skipUnprintable(); return hasNextByte();}
	    public String next() {
	        if (!hasNext()) throw new NoSuchElementException();
	        StringBuilder sb = new StringBuilder();
	        int b = readByte();
	        while(isPrintableChar(b)) {
	            sb.appendCodePoint(b);
	            b = readByte();
	        }
	        return sb.toString();
	    }
	    public long nextLong() {
	        if (!hasNext()) throw new NoSuchElementException();
	        long n = 0;
	        boolean minus = false;
	        int b = readByte();
	        if (b == '-') {
	            minus = true;
	            b = readByte();
	        }
	        if (b < '0' || '9' < b) {
	            throw new NumberFormatException();
	        }
	        while(true){
	            if ('0' <= b && b <= '9') {
	                n *= 10;
	                n += b - '0';
	            }else if(b == -1 || !isPrintableChar(b)){
	                return minus ? -n : n;
	            }else{
	                throw new NumberFormatException();
	            }
	            b = readByte();
	        }
	    }
	    public int nextInt() {
	    	return (int)nextLong();
	    }
	}
}