#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
using namespace std;
const int N = 3e5 + 1;
int t[N * 8], add[N * 8], ans[N * 8];
int lg, rg, x;
int n;
void push(int v, int tl, int tr){
t[v] = max(t[v], add[v]);
int mid = (tl + tr) >> 1;
add[v * 2 + 1] = max(add[v * 2 + 1], add[v]);
add[v * 2] = max(add[v * 2], add[v] - tr + mid);
}
void update(int v = 1, int tl = 1, int tr = n){
push(v, tl, tr);
if(tl > rg || tr < lg)
return;
if(tl >= lg && tr <= rg){
add[v] = max(add[v], x + tr - lg);
push(v, tl, tr);
return;
}
int mid = (tl + tr) >> 1;
update(v * 2, tl, mid);
update(v * 2 + 1, mid + 1, tr);
}
void get(int v = 1, int tl = 1, int tr = n){
push(v, tl, tr);
if(tl == tr){
ans[tl] = t[v];
return;
}else{
int mid = (tl + tr) >> 1;
get(v * 2, tl, mid);
get(v * 2 + 1, mid + 1, tr);
}
}
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int m;
cin >> n >> m;
for(int i = 0; i < m; i++){
cin >> lg >> rg >> x;
update();
}
get();
for(int i = 1; i <= n; i++){
cout << ans[i] <<" ";
}
}
