//#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

const int MAX_N = 1<<17;

struct seg {
  pair<ll, ll> dat[MAX_N*2-1];
  int n, lazy[MAX_N*2-1];

  void init(int n_) {
    n = 1;
    while(n < n_) n *= 2;
    REP(i, n*2-1) {
      dat[i] = {0, 0};
      lazy[i] = -1;
    }
  }

  void eval(int k, int l, int r) {
    if(lazy[k] != -1) {
      if(lazy[k] == 1) {
        dat[k] = MP(r-l, 0);
      } else {
        dat[k] = MP(0, r-l);
      }
      if(r-l>1) {
        lazy[2*k+1] = lazy[k];
        lazy[2*k+2] = lazy[k];
      }
      lazy[k] = -1;
    }
  }

  void update(int a, int b, ll x, int k=0, int l=0, int r=-1) {
    if(r < 0) r = n;
    // cout << a << " " << b << " " << x << " " << k << " " << l << " " << r << endl;

    eval(k, l, r);

    if(b <= l || r <= a) {
      // cout << "a" << endl;
      return;
    }

    if(a <= l && r <= b) {
      // cout << "b" << endl;
      lazy[k] = x;
      eval(k, l, r);
    } else {
      // cout << "c" << endl;
      update(a, b, x, 2*k+1, l, (l+r)/2);
      update(a, b, x, 2*k+2, (l+r)/2, r);
      dat[k] = MP(dat[2*k+1].first + dat[2*k+2].first, dat[2*k+1].second + dat[2*k+2].second);
    }
  }

  pair<ll, ll> getMin(int a, int b, int k=0, int l=0, int r=-1) {
    if(r < 0) r = n;
    // cout << a << " " << b << " " << k << " " << l << " " << r << endl;

    eval(k, l, r);

    if(b <= l || r <= a) {
      // cout << "a" << endl;
      return MP(0, 0);
    }
    if(a <= l && r <= b) {
      // cout << "b" << endl;
      return dat[k];
    }
    // cout << "c" << endl;
    pair<ll, ll> vl = getMin(a, b, 2*k+1, l, (l+r)/2),
    vr = getMin(a, b, 2*k+2, (l+r)/2, r);
    return MP(vl.first + vr.first, vl.second + vr.second);
  }
};

seg sega;
signed main(void)
{
  int n, q;
  cin >> n >> q;
  ll reta = 0, retb = 0;
  sega.init(n);
  REP(i, q) {
    int x, l, r;
    cin >> x >> l >> r;
    if(x == 0) {
      pair<ll, ll> num = sega.getMin(l, r+1);
      if(num.first > num.second) {
        reta += num.first;
      } else if(num.first < num.second) {
        retb += num.second;
      }
    } else if(x == 1) {
      sega.update(l, r+1, 1);
    } else if(x == 2) {
      sega.update(l, r+1, 2);
    }
    // REP(i, sega.n*2-1) cout << sega.dat[i] << " "; cout << endl;
    // REP(i, sega.n*2-1) cout << sega.lazy[i] << " "; cout << endl;
  }

  pair<ll, ll> ret = sega.getMin(0, n);
  reta += ret.first;
  retb += ret.second;
  // REP(i, sega.n*2-1) cout << sega.dat[i] << " "; cout << endl;
  // REP(i, segb.n*2-1) cout << segb.dat[i] << " "; cout << endl;
  cout << reta << " " << retb << endl;

  return 0;
}