// 基本
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
// 型名の省略
using ll = long long;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
// 定数
constexpr long long MOD = 1000000007LL;
template <class T>
constexpr T INF = 0;
template <>
constexpr int INF<int> = 1001001001;
template <>
constexpr long long INF<long long> = 1LL << 61;
template <>
constexpr double INF<double> = INF<long long>;
template <>
constexpr long double INF<long double> = INF<long long>;
// 便利関数
// 入出力処理
template <class... T>
void input(T &...a)
{
    (cin >> ... >> a);
}
void print()
{
    cout << '\n';
}
template <class T, class... Ts>
void print(const T &a, const Ts &...b)
{
    cout << a;
    (cout << ... << (cout << ' ', b));
    cout << '\n';
}
// 繰り返し処理
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (int i = 0; i < a; i++)
#define rep2(i, a) for (int i = 0; i < a; i++)
#define rep3(i, a, b) for (int i = a; i < b; i++)
#define rep4(i, a, b, c) for (int i = a; i < b; i += c)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
// 配列処理
template <class T>
bool operator==(const vector<T> &a, const vector<T> &b)
{
    return (a.size() == b.size()) && equal(a.cbegin(), a.cend(), b.cbegin());
}
template <class T>
bool operator!=(const vector<T> &a, const vector<T> &b)
{
    return !(a == b);
}
// 最小・最大処理
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <class... Args>
inline auto all_max(Args... args)
{
    return max(initializer_list<common_type_t<Args...>>{args...});
}
template <class... Args>
inline auto all_min(Args... args)
{
    return min(initializer_list<common_type_t<Args...>>{args...});
}
// 追加ライブラリ
struct S
{
public:
    ll value;
    ll size;
};
using F = ll;
F Id = -111;
S op(S l, S r)
{
    return {l.value + r.value, l.size + r.size};
}
S e()
{
    return {0, 0};
}
S mapping(F l, S r)
{
    if (l != Id)
        r.value = l * r.size;
    return r;
};
F composition(F l, F r) { return (l == Id ? r : l); };
F id() { return Id; };
/// ここからコードを書く

int main()
{
    cin.tie(0);
    int n, q;
    input(n, q);
    vc<S> A(n, {0, 1});
    lazy_segtree<S, op, e, F, mapping, composition, id> alseg(A), blseg(A);
    ll a_team = 0, b_team = 0;
    rep(iq, q)
    {
        ll x, l, r;
        input(x, l, r);
        r++;
        if (x == 0)
        {
            int ab = alseg.prod(l, r).value, bb = blseg.prod(l, r).value;
            if (ab > bb)
            {
                a_team += ab;
            }
            else if (ab < bb)
            {
                b_team += bb;
            }
        }
        else if (x == 1)
        {
            alseg.apply(l, r, 1);
            blseg.apply(l, r, 0);
        }
        else
        {
            blseg.apply(l, r, 1);
            alseg.apply(l, r, 0);
        }
    }
    a_team += alseg.all_prod().value;
    b_team += blseg.all_prod().value;
    cout << a_team << " " << b_team << endl;
    return 0;
}