#include<cstdio>  
int n,m,v[2011],sol[2011];
void update(int x,int y,int sum)
{
    if(!v[x])  {v[x]=y;sol[x]=sum;return;}
    if(v[x]>y)
    {
        update(y+1,v[x],sol[x]-sum);
        v[x]=y;
        sol[x]=sum;
        return;
    }
    update(v[x]+1,y,sum-sol[x]);
}
int main()
{
    int i,x,y,z,j;
    freopen("reconst.in","r",stdin);
    freopen("reconst.out","w",stdout);
    scanf("%d %d\n",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d %d\n",&x,&y,&z);
        update(x,y,z);
    }
    for(int i=n;i>0;i--)
        for(int j=i+1;j<=v[i];j++)
            sol[i]-=sol[j];
    for(int i=1;i<=n;++i)
        printf("%d%c",sol[i],i==n?'\n':' ');
    return 0;
}