#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>
#include <climits>
#include <numeric>
#include <functional>
#include <time.h>
#include <bitset>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)a; i <= (int)b; i++)
template<class T> void checkmin(T &a, T b) { if (b < a) a = b; }
template<class T> void checkmax(T &a, T b) { if (b > a) a = b; }

const int MaxN = 100000, MaxQ = 100000;
int N, Q;
int X[MaxQ], A[MaxQ], B[MaxQ];

void solve() {
    ll scoreA = 0, scoreB = 0;
    bitset<MaxN> a, b, c;

    rep(i, Q) {
        c.reset();
        c.flip();
        int len = B[i] - A[i] + 1;
        c >>= (MaxN - len);
        c <<= A[i];

        if (X[i] == 0) {
            int countA = (a & c).count(), countB = (b & c).count();
            if (countA > countB) scoreA += countA;
            if (countB > countA) scoreB += countB;
        } else if (X[i] == 1) {
            a |= c;
            c.flip();
            b &= c;
        } else if (X[i] == 2) {
            b |= c;
            c.flip();
            a &= c;
        }
    }

    scoreA += a.count();
    scoreB += b.count();
    printf("%lld %lld\n", scoreA, scoreB);
}

int main() {
    scanf("%d", &N);
    scanf("%d", &Q);
    rep(i, Q) scanf("%d%d%d", &X[i], &A[i], &B[i]);
    solve();
    return 0;
}