#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define MOD(a, m) ((a % m + m) % m)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll MOD = 1e9+7;

template<class S, S (*op)(S, S), S (*init)(), class F, S (*mapping)(F, S), F (*composition)(F, F), F (*id)()>
class LazySegmentTree{
    ll n;
    vector<S> node;
    vector<F> lazy;
    vector<bool> lazyFlag;

public:
    LazySegmentTree(vector<S> v){
        int size = v.size();
        n = 1;
        while(n < size) n *= 2;
        node.resize(2*n-1, init());
        lazy.resize(2*n-1, id());
        lazyFlag.resize(2*n-1, false);

        for(int i = 0; i < size; i++){
            node[n-1+i] = v[i];
        }
        for(int i = n-2; i >= 0; i--){
            node[i] = op(node[2*i+1], node[2*i+2]);
        }
    }

    // k番目のノードについて遅延評価
    void eval(int k, int l, int r){
        if(lazyFlag[k]){
            if(r - l > 1){
                lazy[2*k+1] = composition(lazy[2*k+1], lazy[k]);
                lazy[2*k+2] = composition(lazy[2*k+2], lazy[k]);
                lazyFlag[2*k+1] = lazyFlag[2*k+2] = true;
            }

            node[k] = mapping(lazy[k], node[k]);

            lazy[k] = id();
            lazyFlag[k] = false;
        }
    }

    // 区間更新
    // update val in [a, b] --> update(a, b+1)
    void update(int a, int b, F 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] = composition(lazy[k], x);
            lazyFlag[k] = true;
            eval(k, l, r);
        }
        else{
            update(a, b, x, 2*k+1, l, (l+r)/2);
            update(a, b, x, 2*k+2, (l+r)/2, r);
            node[k] = op(node[2*k+1], node[2*k+2]);
        }
    }

    void abs_update(int idx, S val){
        idx += n-1;
        node[idx] = val;
        while(idx > 0){
            idx = (idx-1)/2;
            node[idx] = op(node[2*idx+1], node[2*idx+2]);
        }
    }

    // get val in [a, b] --> get_val(a, b+1)
    S get_val(int a, int b, int k=0, int l=0, int r=-1){
        if(r < 0) r = n;

        if(b <= l || r <= a) return init();

        eval(k, l, r);

        if(a <= l && r <= b) return node[k];

        S vl = get_val(a, b, 2*k+1, l, (l+r)/2);
        S vr = get_val(a, b, 2*k+2, (l+r)/2, r);
        return op(vl, vr);
    }
};

struct S {
    int a;
    int b;
    int len;
};

/// 例
S op(S lhs, S rhs){
    return S{lhs.a + rhs.a, lhs.b + rhs.b, lhs.len + rhs.len};
}

S init(){
    return S{0, 0, 0};
}

struct F {
    int a;
    int b;
};

S mapping(F x, S s){
    return S{x.a * s.len, x.b * s.len, s.len};
}

F composition(F lhs, F rhs){
    return rhs;
}

F id(){
    return F{0, 0};
}


int main(){
    int N, Q;
    cin >> N >> Q;

    vector<S> vec(N, S{0, 0, 1});
    LazySegmentTree<S, op, init, F, mapping, composition, id> stree(vec);

    ll va = 0, vb = 0;
    while(Q--){
        int x, l, r;
        cin >> x >> l >> r;
        if(x == 0){
            auto val = stree.get_val(l, r+1);
            if(val.a > val.b) va += val.a;
            else if(val.a < val.b) vb += val.b;
        } else if(x == 1){
            stree.update(l, r+1, F{1, 0});
        } else {
            stree.update(l, r+1, F{0, 1});
        }
    }

    auto val = stree.get_val(0, N);
    va += val.a;
    vb += val.b;

    cout << va << " " << vb << endl;
    return 0;
}