#include <stdio.h>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <algorithm>
#include <utility>
#include <string>
#include <functional>
#include <sstream>
#include <fstream>
using namespace std;
#define FOR(i,a,b) for (typeof a i=a;i<=b;i++)
#define fori(it,v) for (typeof ((v).begin()) it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fs first
#define ss second
#define all(c) c.begin(),c.end()
#define pf push_front
#define popb pop_back
#define popf pop_front
ofstream fout;
ostringstream out;
istringstream in;
void initializare_citire()
{
	ifstream fin;
	fin.open("reconst.in",ifstream::in);
	fout.open("reconst.out",ofstream::out);
	string aux;
	getline(fin,aux,'\0');
	in.str(aux);
	fin.close();
}
void scriere()
{
	fout<<out.str();
	fout.close();
}
vector<vector<pair<int,int> > > a;
int sol[2005];
int main()
{
	initializare_citire();
	int n,m,x,y,z;
	in>>n>>m;
	a.resize(n+3);
	FOR(i,1,m)
	{
		in>>x>>y>>z;
		a[x].pb(mp(y,z));
	}
	FOR(i,1,n)
	{
		int nr=a[i].size();
		while (nr>1)
		{
			if (a[i][0].fs==a[i][nr-1].fs)
				a[i].popb();
			else
			{
				if (a[i][0].fs>a[i][nr-1].fs)
					swap(a[i][0],a[i][nr-1]);
				a[a[i][0].fs+1].pb(mp(a[i][nr-1].fs,a[i][nr-1].ss-a[i][0].ss));
	//			printf("creare suma %d - %d de la %d la %d\n",a[i][nr-1].ss,a[i][0].ss,a[i][0].fs,a[i][nr-1].fs);
			}
			nr--;
		}
		if (nr)
	//		printf("suma %d  de la %d la %d\n",a[i][0].ss,i,a[i][0].fs); 
	}
	for(int i=n;i>=1;i--)
		if(!a[i].empty())
		{
			sol[i]=a[i][0].ss;
			FOR(j,1,i-1)
			if (!a[j].empty())
			{
				if (a[j][0].fs>=i)
					a[j][0].ss-=sol[i];
			}
		}
	FOR(i,1,n)
		out<<sol[i]<<' ';	
	scriere();
	return 0;
}