#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000000000000000ll + 9;
const ll inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

vector<ll> vx;

struct segtree { // this is piece of shit. use BIT
	int n; vl sum, lazy, mul;
	void init(int mx) {
		n = 1;
		while(n < mx) n *= 2;
		sum = vl(n * 2, 0);
		mul = vl(n * 2, 1);
		lazy = vl(n * 2, 0);
	}
	segtree(int mx = 0) { init(mx); }
	inline void lazy_eval(int k, int l, int r) {
		int m = (l + r) / 2;
		if(mul[k] != 1 || lazy[k]) {
			MUL(sum[k * 2 + 1], mul[k]);//if range_min, erase (m - l)
			ADD(sum[k * 2 + 1], (vx[m] - vx[l]) * lazy[k]);
			MUL(mul[k * 2 + 1], mul[k]);
			MUL(lazy[k * 2 + 1], mul[k]);
			ADD(lazy[k * 2 + 1], lazy[k]);
			MUL(sum[k * 2 + 2], mul[k]);//if range_min, erase (m - l)
			ADD(sum[k * 2 + 2], (vx[r] - vx[m]) * lazy[k]);
			MUL(mul[k * 2 + 2], mul[k]);
			MUL(lazy[k * 2 + 2], mul[k]);
			ADD(lazy[k * 2 + 2], lazy[k]);
			mul[k] = 1;
			lazy[k] = 0;
		}
	}
	void app(int a, int b, ll s, int k, int l, int r) {
		if(b <= l || r <= a) return;
		if(a <= l && r <= b) {
			MUL(sum[k], s);
			MUL(lazy[k], s);
			MUL(mul[k], s);
			ADD(sum[k], (vx[r] - vx[l]) * s); //here too
			ADD(lazy[k], s);
		}
		else {
			lazy_eval(k, l, r);
			app(a, b, s, k * 2 + 1, l, (l + r) / 2);
			app(a, b, s, k * 2 + 2, (l + r) / 2, r);
			sum[k] = (sum[k * 2 + 1] + sum[k * 2 + 2]) % mod;
		}
	}
	ll ga(int a, int b, int k, int l, int r) {
		if(b <= l || r <= a) return ll();
		if(a <= l && r <= b) return sum[k];
		else {
			lazy_eval(k, l, r);
			ll lv = ga(a, b, k * 2 + 1, l, (l + r) / 2);
			ll rv = ga(a, b, k * 2 + 2, (l + r) / 2, r);
			return (lv + rv) % mod;
		}
	}
	void show() {
		vector<ll> tmp;
		rep(i, 0, n) tmp.push_back(get(i, i + 1));
		debug(tmp);
	}
	ll get(int a, int b) { return ga(a, b, 0, 0, n); } //[a, b)
	void update(int a, int b, ll s) { app(a, b, s, 0, 0, n); } //[a, b)
};


int fd(ll a) {
	return lower_bound(all(vx), a) - vx.begin();
}

ll N, Q;
ll X[MAX_N], L[MAX_N], R[MAX_N];
ll ans[MAX_N];

segtree seg[5];

void solve() {
	cin >> N >> Q;
	rep(i, 0, Q) {
		cin >> X[i] >> L[i] >> R[i]; R[i]++;
		vx.pb(L[i]); vx.pb(R[i]);
	}
	sort(all(vx)); vx.erase(unique(all(vx)), vx.end());
	rep(i, 0, 5) seg[i].init(sz(vx));
	// debug(vx);
	rep(i, 0, Q) {
		// rep(j, 0, 2) {
		// 	debug(i, j);
		// 	seg[j].show();
		// 	// debug(seg[j].zero);
		// 	// debug(seg[j].sum);
		// 	// debug(seg[j].lazy);
		// }
		int l = fd(L[i]), r = fd(R[i]);
		// debug(l, r, L[i], R[i]);
		if(X[i] == 0) {
			vector<ll> vec(5);
			rep(j, 0, 5) vec[j] = seg[j].get(l, r);
			int at = -1; ll mv = -linf;
			rep(j, 0, 5) {
				if(mv < vec[j]) {
					at = j; mv = vec[j];
				}
				else if(mv == vec[j]) at = -1;
			}
			if(at != -1) ADD(ans[at], vec[at]);
		}
		else {
			rep(j, 0, 5) {
				if(j == X[i] - 1) seg[j].update(l, r, 1);
				else seg[j].update(l, r, 0);
			}
		}
	}
	rep(j, 0, 5) {
		ADD(ans[j], seg[j].get(0, sz(vx)));
		cout << ans[j] << (j == 4 ? '\n' : ' ');
	}
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}