#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, Q;
    cin >> N >> Q;
    const int LEN = 100010;
    bitset<LEN> B[2], mask;
    int ans[2] = {};
    while (Q--) {
        int x, l, r;
        cin >> x >> l >> r;
        r++;
        mask.reset();
        mask.flip();
        mask >>= LEN - (r - l);
        mask <<= l;
        if (x == 0) {
            int cnt[2];
            cnt[0] = (mask & B[0]).count();
            cnt[1] = (mask & B[1]).count();
            if (cnt[0] > cnt[1])
                ans[0] += cnt[0];
            else if (cnt[1] > cnt[0])
                ans[1] += cnt[1];
        } else {
            x--;
            B[x] |= mask;
            mask.flip();
            B[1 - x] &= mask;
        }
    }
    ans[0] += B[0].count();
    ans[1] += B[1].count();
    cout << ans[0] << " " << ans[1] << endl;
}