#include<bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
namespace mp = boost::multiprecision;
using ll = long long;
using Bint = mp::int256_t;
ll MOD = 1000000000000000009ll;

template <class S,
            S (*op)(S, S),
            S (*e)(),
            class F,
            S (*mapping)(F, S),
            F (*composition)(F, F),
            F (*id)()>
struct lazy_segtree {
    public:
        lazy_segtree() : lazy_segtree(0) {}
        lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}
        lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        lz = std::vector<F>(size, id());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
                update(i);
            }
        }
        void set(int p, S x) {
            assert(0 <= p && p < _n);
            p += size;
            for (int i = log; i >= 1; i--) push(p >> i);
            d[p] = x;
            for (int i = 1; i <= log; i++) update(p >> i);
        }
        S get(int p) {
            assert(0 <= p && p < _n);
            p += size;
            for (int i = log; i >= 1; i--) push(p >> i);
            return d[p];
        }
        S prod(int l, int r) {
            assert(0 <= l && l <= r && r <= _n);
            if (l == r) return e();
            l += size;
            r += size;
            for (int i = log; i >= 1; i--) {
                if (((l >> i) << i) != l) push(l >> i);
                if (((r >> i) << i) != r) push(r >> i);
            }
        S sml = e(), smr = e();
            while (l < r) {
                if (l & 1) sml = op(sml, d[l++]);
                if (r & 1) smr = op(d[--r], smr);
                l >>= 1;
                r >>= 1;
            }
            return op(sml, smr);
        }
        S all_prod() { return d[1]; }
        void apply(int p, F f) {
            assert(0 <= p && p < _n);
            p += size;
            for (int i = log; i >= 1; i--) push(p >> i);
            d[p] = mapping(f, d[p]);
            for (int i = 1; i <= log; i++) update(p >> i);
        }
        void apply(int l, int r, F f) {
            assert(0 <= l && l <= r && r <= _n);
            if (l == r) return;
            l += size;
            r += size;
            for (int i = log; i >= 1; i--) {
                if (((l >> i) << i) != l) push(l >> i);
                if (((r >> i) << i) != r) push((r - 1) >> i);
            }
            {
                int l2 = l, r2 = r;
                while (l < r) {
                    if (l & 1) all_apply(l++, f);
                    if (r & 1) all_apply(--r, f);
                    l >>= 1;
                    r >>= 1;
                }
                l = l2;
                r = r2;
            }
            for (int i = 1; i <= log; i++) {
                if (((l >> i) << i) != l) update(l >> i);
                if (((r >> i) << i) != r) update((r - 1) >> i);
            }
            }
        template <bool (*g)(S)> int max_right(int l) {
            return max_right(l, [](S x) { return g(x); });
        }
        template <class G> int max_right(int l, G g) {
            assert(0 <= l && l <= _n);
            assert(g(e()));
            if (l == _n) return _n;
            l += size;
            for (int i = log; i >= 1; i--) push(l >> i);
            S sm = e();
            do {
                while (l % 2 == 0) l >>= 1;
                if (!g(op(sm, d[l]))) {
                    while (l < size) {
                        push(l);
                        l = (2 * l);
                        if (g(op(sm, d[l]))) {
                            sm = op(sm, d[l]);
                            l++;
                        }
                    }
                    return l - size;
                }
                sm = op(sm, d[l]);
                l++;
            } while ((l & -l) != l);
            return _n;
        }
        template <bool (*g)(S)> int min_left(int r) {
            return min_left(r, [](S x) { return g(x); });
        }
        template <class G> int min_left(int r, G g) {
            assert(0 <= r && r <= _n);
            assert(g(e()));
            if (r == 0) return 0;
            r += size;
            for (int i = log; i >= 1; i--) push((r - 1) >> i);
            S sm = e();
            do {
                r--;
                while (r > 1 && (r % 2)) r >>= 1;
                if (!g(op(d[r], sm))) {
                    while (r < size) {
                        push(r);
                        r = (2 * r + 1);
                        if (g(op(d[r], sm))) {
                            sm = op(d[r], sm);
                            r--;
                        }
                    }
                    return r + 1 - size;
                }
                sm = op(d[r], sm);
            } while ((r & -r) != r);
            return 0;
        }
    private:
        int _n, size, log;
        std::vector<S> d;
        std::vector<F> lz;
        void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
        void all_apply(int k, F f) {
            d[k] = mapping(f, d[k]);
            if (k < size) lz[k] = composition(f, lz[k]);
        }
        void push(int k) {
            all_apply(2 * k, lz[k]);
            all_apply(2 * k + 1, lz[k]);
            lz[k] = id();
        }
        int ceil_pow2(int n) {
            int x = 0;
            while ((1U << x) < (unsigned int)(n)) x++;
            return x;
        }
};

using S = array<Bint, 6>;
using F = int;
//単位元
S e(){return S({0, 0, 0, 0, 0, 0});}
//演算
S op(S l,S r){
    for(int i = 0; i < 6; i++){
        l[i] += r[i];
    }
    return l;
}
//xにfを作用させた時の値の変化
S mapping(F f,S x){
    if(f == -1)return x;
    for(int i = 0; i < 5; i++){
        if(i == f)continue;
        x[i] = 0;
    }
    x[f] += x[5];
    return x;
}
//gを演算した後にfを演算させると演算子はどうなるか
F composition(F f, F g){
    if(f == -1)return g;
    return f;
}
//作用させても変化させないもの
F id(){return -1;}

int main(){
    ll n, Q;
    cin >> n >> Q;
    vector<array<ll,3>> a(Q);
    vector<ll> c = {0, n};
    for(int i = 0; i < Q; i++){
        cin >> a[i][0] >> a[i][1] >> a[i][2];
        c.push_back(a[i][1]);
        c.push_back(++a[i][2]);
    }
    sort(c.begin(), c.end());
    c.erase(unique(c.begin(), c.end()), c.end());
    lazy_segtree<S, op, e, F, mapping, composition, id> seg(c.size());
    for(int i = 0; i + 1 < c.size(); i++){
        seg.set(i, S({0, 0, 0, 0, 0, c[i + 1] - c[i]}));
    }
    vector<Bint> score(5);
    for(int i = 0; i < Q; i++){
        for(int j = 1; j < 3; j++){
            a[i][j] = lower_bound(c.begin(), c.end(), a[i][j]) - c.begin();
        }
        if(a[i][0]){
            seg.apply(a[i][1], a[i][2], a[i][0] - 1);
        }else{
            auto b = seg.prod(a[i][1], a[i][2]);
            Bint maxv = -1;
            int pos = -1;
            for(int j = 0; j < 5; j++){
                if(b[j] == maxv){
                    pos = -1;
                    continue;
                }
                if(b[j] > maxv){
                    maxv = b[j];
                    pos = j;
                }
            }
            (score[pos] += maxv) %= MOD;
        }
    }
    auto b = seg.all_prod();
    for(int i = 0; i < 5; i++){
        if(i)cout << " ";
        cout << (score[i] + b[i]) % MOD;
    }
    cout << endl;
}