#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<atcoder/lazysegtree>
using namespace std;
using namespace atcoder;

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

using F = int;

S op(S l, S r){
    return S{l.a + r.a, l.b + r.b, l.size + r.size};
}

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

S mapping(F f, S x){
    if(f == 1){
        x.a = x.size;
        x.b = 0;
    }
    else if(f == 2){
        x.a = 0;
        x.b = x.size;
    }
    return x;
}

F composition(F f, F g){
    if(f == -1) return g;
    else return f;
}

F id(){
    return -1;
}

void solve(){
    int n;
    int Q;
    cin >> n >> Q;
    vector<S> A(n, {0, 0, 1});
    lazy_segtree<S, op, e, F, mapping, composition, id> seg(A);
    long long a = 0;
    long long b = 0;
    int t, l, r;
    while(Q--){
        cin >> t >> l >> r;
        r++;        
        if(t == 0){
            auto ret = seg.prod(l, r);
            if(ret.a > ret.b) a += ret.a;
            else if(ret.a < ret.b) b += ret.b;
        }
        else{
            seg.apply(l, r, t);
        }
    }
    auto ret = seg.prod(0, n);
    a += ret.a;
    b += ret.b;
    cout << a << " " << b << "\n";
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int t;
    t = 1;
    // cin >> t;
    while(t--) solve();
}