#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, int> P;
template<typename Monoid, typename OperatorMonoid=Monoid>
struct LazySegmentTree{
	using F=function<Monoid(Monoid, Monoid)>;
	using G=function<Monoid(Monoid, OperatorMonoid, int, int)>;
	using H=function<OperatorMonoid(OperatorMonoid, OperatorMonoid)>;
	int sz;
	vector<Monoid> data;
	vector<OperatorMonoid> lazy;
	const F f;
	const G g;
	const H h;
	const Monoid e1;
	const OperatorMonoid e0;

	LazySegmentTree(int n, const F f, const G g, const H h, const Monoid &e1, const OperatorMonoid &e0): f(f), g(g), h(h), e1(e1), e0(e0){
		sz=1;
		while(sz<n) sz<<=1;
		data.resize(2*sz-1, e1);
		lazy.resize(2*sz-1, e0);
	}

	void build(vector<Monoid> v){
		for(int i=0; i<v.size(); i++) data[i+sz-1]=v[i];
		for(int i=sz-2; i>=0; i--) data[i]=f(data[2*i+1], data[2*i+2]);
	}

	void eval(int k, int l, int r){
		if(lazy[k]!=e0){
			data[k]=g(data[k], lazy[k], l, r);
			if(k<sz-1){
				lazy[2*k+1]=h(lazy[2*k+1], lazy[k]);
				lazy[2*k+2]=h(lazy[2*k+2], lazy[k]);
			}
		}
		lazy[k]=e0;
	}

	void update(int a, int b, const OperatorMonoid &x, int k, int l, int r){
		eval(k, l, r);
		if(r<=a || b<=l) return;
		if(a<=l && r<=b){
			lazy[k]=h(lazy[k], x);
			eval(k, l, r);
		}else{
			update(a, b, x, 2*k+1, l, (l+r)/2);
			update(a, b, x, 2*k+2, (l+r)/2, r);
			data[k]=f(data[2*k+1], data[2*k+2]);
		}
	}
	void update(int a, int b, const OperatorMonoid &x){
		return update(a, b, x, 0, 0, sz);
	}

	Monoid find(int a, int b, int k, int l, int r){
		eval(k, l, r);
		if(b<=l || r<=a) return e1;
		if(a<=l && r<=b) return data[k];
		else return f(find(a, b, 2*k+1, l, (l+r)/2), find(a, b, 2*k+2, (l+r)/2, r));
	}
	Monoid find(int a, int b){
		return find(a, b, 0, 0, sz);
	}
	Monoid operator[](const int &k){
		return find(k, k+1);
	}
};
const ll MOD=1000000000000000009;
int main()
{
    using arr=array<ll, 5>;
    ll n;
    cin>>n;
    int q;
    cin>>q;
    int x[150010];
    ll l[150010], r[150010];
    vector<ll> v(2*q);
    for(int i=0; i<q; i++){
        cin>>x[i]>>l[i]>>r[i];
        r[i]++;
        v[2*i]=l[i], v[2*i+1]=r[i];
    }
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    int m=v.size();
    for(int i=0; i<q; i++){
        l[i]=lower_bound(v.begin(), v.end(), l[i])-v.begin();
        r[i]=lower_bound(v.begin(), v.end(), r[i])-v.begin();
    }
    auto f=[](arr a, arr b){
        arr c={};
        for(int i=0; i<5; i++) c[i]=a[i]+b[i];
        return c;
    };
    auto g=[&](arr a, P p, int l, int r){
        if(p.first!=0){
            for(int i=0; i<5; i++){
                if(i==p.second) continue;
                if(a[i]!=0){
                    arr b={};
                    b[p.second]=a[p.second]+p.first*(v[r]-v[l]);
                    return b;
                }
            }
            a[p.second]+=p.first*(v[r]-v[l]);
            return a;
        }else{
            return a;
        }
    };
    auto h=[](P p, P q){
        if(p.second==q.second) return P(p.first+q.first, p.second);
        else return q;
    };
    arr e={};
    LazySegmentTree<arr, P> seg(m-1, f, g, h, e, P(0, -1));
    ll ans[5]={};
    for(int i=0; i<q; i++){
        if(x[i]==0){
            arr a=seg.find(l[i], r[i]);
            int id=0;
            for(int j=1; j<5; j++){
                if(a[id]<a[j]) id=j;
            }
            bool dame=0;
            for(int j=id+1; j<5; j++) if(a[id]==a[j]) dame=1;
            if(dame) continue;
            ans[id]+=a[id];
            if(ans[id]>=MOD) ans[id]-=MOD;
        }else{
            seg.update(l[i], r[i], P(1, x[i]-1));
        }
    }
    arr a=seg.find(0, m-1);
    for(int i=0; i<5; i++){
        ans[i]+=a[i];
        if(ans[i]>=MOD) ans[i]-=MOD;
        cout<<ans[i]<<" ";
    }
    cout<<endl;
    return 0;
}