#include <bits/stdc++.h>

using namespace std;
ifstream f("reconst.in");
ofstream g("reconst.out");
struct wow
{
    int x,y,z;
}ceau[2005];
int n,m,i,x,y,z,sol[2005],sum[2005],cap[2005],j;
vector <pair <int,int> > v[2005];
int main()
{
    f>>n>>m;
    for (i=1;i<=m;i++)
    {
        f>>x>>y>>z;
        ceau[i].x=x;
        ceau[i].y=y;
        ceau[i].z=z;
        v[x].push_back({y,z});
    }
    for (i=1;i<=n;i++)
    {
        sort (v[i].begin(),v[i].end());
        for (j=(int)v[i].size()-2;j>=0;j--)
        {
            int poz1=v[i][j].first,poz2=v[i][j+1].first;
            v[poz1+1].push_back({poz2,v[i][j+1].second-v[i][j].second});
        }
    }
    for (i=1;i<=n;i++)
    {
        if (v[i].size()!=0)
        {
           cap[i]=v[i][0].first;
        }
    }
    for (i=n;i>=1;i--)
    {
        if (cap[i]!=0)
        {
            sol[i]=v[i][0].second-(sum[i+1]-sum[cap[i]+1]);
        }
        sum[i]=sum[i+1]+sol[i];
    }
    for (i=1;i<=n;i++)
    {
        g<<sol[i]<<" ";
    }
    return 0;
}