#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

template <typename T> 
struct LazySegmentTree {
  
  int n;
  vector<T> node, lazy;

  T f(T a, T b) {return (a + b);}

  LazySegmentTree (int sz, T init = 0) {
    n = 1; while (n < sz) n <<= 1;
    node.assign(2*n, init);
    lazy.assign(2*n,-1); 
  }

  void eval (int k, int l, int r) {
    if (lazy[k] == -1) return ;
    node[k] = (r-l)*lazy[k];
    if (k < n) {
      lazy[2*k+1] = lazy[k];
      lazy[2*k+2] = lazy[k];
    }
    lazy[k] = -1;
  }

  void update(int a, int b, T x, int k = 0, int l = 0, int r = -1) {
    if (r < 0) r = n;
    eval(k,l,r);
    if (b <= l || r <= a) return ;
    if (a <= l && r <= b) {
      lazy[k] = x;
      eval(k,l,r);
    } else {
      update(a, b, x, 2*k+1, l, (r+l)/2);
      update(a, b, x, 2*k+2, (r+l)/2, r);
      node[k] = f(node[2*k+1], node[2*k+2]);
    }
  }

  T query(int a, int b, int k = 0, int l = 0, int r = -1) {
    if (r < 0) r = n;
    eval(k,l,r);
    if (r <= a || b <= l) return 0;
    if (a <= l && r <= b) return node[k];
    T vl = query(a, b, 2*k+1, l, (l+r)/2);
    T vr = query(a, b, 2*k+2, (l+r)/2, r);
    return f(vl, vr);
  }

  T getvalue(int k) {
    return query(k,k+1);
  }

};
int main(){
  int n, q;
  cin >> n >> q;
  LazySegmentTree<ll> sega(n), segb(n);
  ll sa = 0, sb = 0;
  while (q--) {
    int c, l, r;
    cin >> c >> l >> r;
    if (c == 0) {
      int va = sega.query(l,r+1);
      int vb = segb.query(l,r+1);
      if (va > vb) sa += va;
      else if (vb > va) sb += vb;
    } else if (c == 1) {
      sega.update(l,r+1,1);
      segb.update(l,r+1,0);
    } else if (c == 2) {
      sega.update(l,r+1,0);
      segb.update(l,r+1,1);
    }
  }
  cout << sa + sega.query(0,n) << " " << sb + segb.query(0,n) << endl;
  return 0;
}