#include using namespace std; using ll = long long; const ll MOD = 1'000'000'000'000'000'009ll; template struct lazy_segtree { public: lazy_segtree() : lazy_segtree(0) {} lazy_segtree(int n) : lazy_segtree(std::vector(n, e())) {} lazy_segtree(const std::vector& v) : _n(int(v.size())) { log = ceil_pow2(_n); size = 1 << log; d = std::vector(2 * size, e()); lz = std::vector(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 int max_right(int l) { return max_right(l, [](S x) { return g(x); }); } template 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 int min_left(int r) { return min_left(r, [](S x) { return g(x); }); } template 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 d; std::vector 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; using F = pair; //単位元 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.first == 0)return x; ll temp = 0; if(f.first > 0)temp = x[f.first]; f.first = abs(f.first); fill(x.begin() + 1, x.end(), 0); x[f.first] = temp + x[0] * f.second; return x; } //gを演算した後にfを演算させると演算子はどうなるか F composition(F f, F g){ if(f == make_pair(0, 0))return g; if(g == make_pair(0, 0))return f; if(abs(f.first) != abs(g.first))return make_pair(-f.first, 1); return make_pair(min(f.first, g.first), f.second + g.second); } //作用させても変化させないもの F id(){return make_pair(0, 0);} void add(ll &x, ll y){ x += y; while(x >= MOD)x -= MOD; } int main(){ ios::sync_with_stdio(false); cin.tie(0); ll N, l, r; int Q, cmd; cin >> N >> Q; vector> query(Q); vector ca = {0, N}; for(int i = 0; i < Q; i++){ cin >> cmd >> l >> r; r++; query[i] = make_tuple(cmd, l, r); ca.push_back(l); ca.push_back(r); } sort(ca.begin(), ca.end()); ca.erase(unique(ca.begin(), ca.end()), ca.end()); vector temp(ca.size(), e()); for(int i = 0; i + 1 < ca.size(); i++){ temp[i][0] = ca[i + 1] - ca[i]; } lazy_segtree seg(temp); array score{}; for(int i = 0; i < Q; i++){ tie(cmd, l, r) = query[i]; l = lower_bound(ca.begin(), ca.end(), l) - ca.begin(); r = lower_bound(ca.begin(), ca.end(), r) - ca.begin(); if(cmd == 0){ auto v = seg.prod(l, r); auto it = max_element(v.begin() + 1, v.end()); if(count(v.begin() + 1, v.end(), *it) >= 2)continue; add(score[it - v.begin()], *it); }else{ seg.apply(l, r, make_pair(cmd, 1)); } } auto v = seg.all_prod(); for(int i = 1; i < 6; i++){ add(score[i], v[i]); cout << score[i] << (i + 1 == 6 ? '\n' : ' '); } }