package test;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;


public class Main {

	public static void main(String[] args) {
//		RangeSetRangeSumLong st = new RangeSetRangeSumLong(8);
//		st.set(0, 7, 10);
//		System.out.println(st.sum(3, 5));
	    IO io = new IO();
	    int n = io.nextInt();
	    int q = io.nextInt();
	    RangeSetRangeSumLong teamA = new RangeSetRangeSumLong(n);
	    RangeSetRangeSumLong teamB = new RangeSetRangeSumLong(n);
	    long scoreA = 0,scoreB = 0;
//		System.out.println("----");
//		System.out.println(teamA);
//		System.out.println(teamB);
	    for(int i=0;i<q;i++) {
	        int x = io.nextInt();
	        int l = io.nextInt();
	        int r = io.nextInt();
	        if (x == 0) {
	            long a = teamA.sum(l, r + 1);
	            long b = teamB.sum(l, r + 1);
//				System.out.println(a + " - " + b);
	            if (a > b) {
	                scoreA += a;
	            }else if(a < b) {
	                scoreB += b;
	            }
	        }else if(x == 1) {
	            teamA.set(l, r + 1, 1);
	            teamB.set(l, r + 1, 0);
	        }else{
	            teamA.set(l, r + 1, 0);
	            teamB.set(l, r + 1, 1);
	        }
//			System.out.println("----");
//			System.out.println(teamA);
//			System.out.println(teamB);

	    }
	    scoreA += teamA.sum(0, n);
	    scoreB += teamB.sum(0, n);
	    System.out.println(scoreA + " " + scoreB);
	}

}
class RangeSetRangeSumLong {
	private int size,n = 1;
	private long[] sum;
	private boolean[] lazy;
	private long[] lazyValue;
	public RangeSetRangeSumLong(int size) {
		this.size = size;
		while(this.n<this.size) {
			this.n*=2;
		}
		sum = new long[n*2-1];
		lazy = new boolean[n*2-1];
		lazyValue = new long[n*2-1];
	}

	private void propagate(int k) {
		if (lazy[k] && k < n - 1) {
			sum[k*2+1] = sum[k*2+2] = sum[k] >> 1; //区間の長さが半分だからこうなる
			lazy[k*2+1] = lazy[k*2+2] = true;
			lazyValue[k*2+1] = lazyValue[k*2+1] = lazyValue[k];
		}
		lazy[k] = false;
	}

	private void update(int k) {
		sum[k] = sum[k*2+1] + sum[k*2+2];
	}

	public void set(int begin,int end,long x) {
		set(begin,end,x,0,0,n);
	}

	private void set(int begin,int end,long x,int k,int l,int r) {
		propagate(k); //先に遅延された値があれば伝搬

		if (r <= begin || end <= l) { //交差してない
			return;
		}
		if (begin <= l && r <= end) { //含んでるからここの値はちゃんとして、下に丸投げ。
			sum[k] = x * (r - l);
			lazy[k] = true;
			lazyValue[k] = x;
			propagate(k);
			return;
		}

		//中途半端な場合はちゃんとやらないとまずい
		set(begin,end,x,k*2+1,l,(l+r)>>>1);
		set(begin,end,x,k*2+2,(l+r)>>>1,r);
		update(k);
		//この3つでここの値がちゃんとする
	}

	public long sum(int begin,int end) {
		return sum(begin,end,0,0,n);
	}

	private long sum(int begin,int end,int k,int l,int r) {
		propagate(k); //先に遅延された値があれば伝搬

		if (r <= begin || end <= l) { //交差してない
			return 0;
		}
		if (begin <= l && r <= end) { //含んでる。ここの値は正しくなってる。
			return sum[k];
		}
		//ちゃんと計算
		long sum1 = sum(begin,end,k*2+1,l,(l+r)/2);
		long sum2 = sum(begin,end,k*2+2,(l+r)/2,r);
		update(k); //遅延伝搬があるからsumクエリでも値の更新が必要。
		return sum1 + sum2;
	}

	//遅延伝搬大破壊
	public String toString() {
		ArrayList<Long> data = new ArrayList<>();
		for(int i=0;i<size;i++) {
			data.add(sum(i, i+1));
		}
		return data.toString();
	}
}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	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 static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; 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 char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(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() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}