#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename X, typename M>
struct SegTreeLazy {//遅延セグ木　単位元に注意(updateなら選ばれない数、affineなら(1,0))
    using FX = function<X(X, X)>;
    using FA = function<X(X, M, int)>;
    using FM = function<M(M, M)>;
    int n;
    FX fx;
    FA fa;
    FM fm;
    const X ex;
    const M em;
    vector<X> dat;
    vector<M> lazy;
    SegTreeLazy(int n_, FX fx_, FA fa_, FM fm_, X ex_, M em_)
        : n(), fx(fx_), fa(fa_), fm(fm_), ex(ex_), em(em_), dat(n_ * 4, ex), lazy(n_ * 4, em) {
        int x = 1;
        while (n_ > x) x *= 2;
        n = x;
    }
    void set(int i, X x) { dat[i + n - 1] = x; }
    void build() {
        for (int k = n - 2; k >= 0; k--) dat[k] = fx(dat[2 * k + 1], dat[2 * k + 2]);
    }
    /* lazy eval */
    void eval(int k, int len) {
        if (lazy[k] == em) return;  // 更新するものが無ければ終了
        if (k < n - 1) {            // 葉でなければ子に伝搬
            lazy[k * 2 + 1] = fm(lazy[k * 2 + 1], lazy[k]);
            lazy[k * 2 + 2] = fm(lazy[k * 2 + 2], lazy[k]);
        }
        // 自身を更新
        dat[k] = fa(dat[k],lazy[k],len);//fa(dat[k], fp(lazy[k], len));
        lazy[k] = em;
    }
    void update(int a, int b, M x, int k, int l, int r) {
        eval(k, r - l);
        if (a <= l && r <= b) {  // 完全に内側の時
            lazy[k] = fm(lazy[k], x);
            eval(k, r - l);
        } else if (a < r && l < b) {                     // 一部区間が被る時
            update(a, b, x, k * 2 + 1, l, (l + r) / 2);  // 左の子
            update(a, b, x, k * 2 + 2, (l + r) / 2, r);  // 右の子
            dat[k] = fx(dat[k * 2 + 1], dat[k * 2 + 2]);
        }
    }
    void update(int a, int b, M x) { update(a, b, x, 0, 0, n); }
    X query_sub(int a, int b, int k, int l, int r) {
        eval(k, r - l);
        if (r <= a || b <= l) {  // 完全に外側の時
            return ex;
        } else if (a <= l && r <= b) {  // 完全に内側の時
            return dat[k];
        } else {  // 一部区間が被る時
            X vl = query_sub(a, b, k * 2 + 1, l, (l + r) / 2);
            X vr = query_sub(a, b, k * 2 + 2, (l + r) / 2, r);
            return fx(vl, vr);
        }
    }
    X query(int a, int b) { return query_sub(a, b, 0, 0, n); }
    X operator[](int i){
        return query(i,i+1);
    }
};
struct query{
  ll x,a,b;
};
vector<ll> compress(vector<query> &qs){
  vl pls;for(auto p:qs)pls.emplace_back(p.a),pls.emplace_back(p.b);
  sort(all(pls));pls.erase(unique(all(pls)),pls.end());
  for(auto &p:qs){
    p.a=lower_bound(all(pls),p.a)-pls.begin();
    p.b=lower_bound(all(pls),p.b)-pls.begin();
  }
  vl weight(pls.size());
  rep(i,pls.size()-1)weight[i]=pls[i+1]-pls[i];
  return weight;
}

int main(){
  ll n,q;cin >> n >>q;
  if(!q){
    rep(i,5)cout << 0 <<" ";cout << endl;
    return 0;
  }
  vector<query> qs(q);
  rep(i,q){
    ll a,b,c;cin >>a  >> b >> c;c++;
    qs[i]={a,b,c};
  }
  auto weight=compress(qs);
  n=weight.size();
  auto fx=[](pl a,pl b){return make_pair(a.fi+b.fi,a.se+b.se);};
  auto fa=[](pl a,pl b,int len){
    if(b.se)return make_pair(a.se*b.fi,a.se);//b.seの時、0リセットしてから加算
    return make_pair(a.fi+a.se*b.fi,a.se);
  };
  auto fm=[](pl a,pl b){
    if(b.se)return b;
    return make_pair(a.fi+b.fi,a.se);
  };
  SegTreeLazy<pl,pl> st(n,fx,fa,fm,{0,0},{0,0});
  rep(i,n)st.set(i,{0,weight[i]});st.build();
  vvl g(q);
  vl score(6);
  for(int j=1;j<=5;j++){
    rep(i,q){
      if(qs[i].x==0)g[i].emplace_back(st.query(qs[i].a,qs[i].b).first);
      else{
        if(j==qs[i].x)st.update(qs[i].a,qs[i].b,{1,0});
        else st.update(qs[i].a,qs[i].b,{0,1});
      }
    }
    score[j]+=st.query(0,n).first;
    st.update(0,n,{0,1});
  }
  rep(i,q){
    if(g[i].empty())continue;
    ll p=*max_element(all(g[i]));
    ll cnt=0;
    for(auto t:g[i])if(t==p)cnt++;
    if(cnt!=1)continue;
    rep(j,5)if(p==g[i][j]){
      score[j+1]+=p;
      score[j+1]%=INF/4+9;
    }
  }
  for(int j=1;j<=5;j++)cout << score[j] <<" ";cout << endl;
}