#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;

const int N = 2e5 + 10, M = 3 * N;
int n, m;

int h[N], ne[M], e[M], w[M], idx;
void add(int a, int b, int c)
{
	e[++idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx;
}

int dis[N];
bool in[N];
void spfa()
{
	memset(dis, -0x3f, sizeof(dis));
	stack<int> q;
	dis[0] = 0, q.push(0), in[0] = 1;
	
	while(!q.empty())
	{
		int t = q.top(); q.pop();
		in[t] = 0;
		
		for(int i = h[t]; i; i = ne[i])
		{
			int j = e[i];
			if(dis[j] < dis[t] + w[i])
			{
				dis[j] = dis[t] + w[i];
				if(!in[j]) q.push(j), in[j] = 1;
			}
		}
	}
}

int main()
{
	cin >> n >> m;
	while(m--)
	{
		int l, r, x;
		scanf("%d%d%d", &l, &r, &x);
		add(l - 1, r, x);
	}
	for(int i = 1; i <= n; i++) add(i - 1, i, 0);
	for(int i = 0; i < n; i++) add(i + 1, i, -1);
	
	spfa();
	
	for(int i = 1; i <= n; i++)
		printf("%d ", dis[i] - dis[i - 1]);
	return 0;
}