#include<bits/stdc++.h>
using namespace std;
void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << h; if(sizeof...(t)) cerr << ", ";
DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL
#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"
using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;
void setIO(string NAME = "") {
cin.tie(0)->sync_with_stdio(0);
if(sz(NAME)) {
freopen((NAME + ".inp").c_str(),"r",stdin);
freopen((NAME + ".out").c_str(),"w",stdout);
}
}
tcT> bool ckmin(T&a, const T&b) {
return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
return b > a ? a=b,1 : 0; }
const int MOD = 1e9 + 7;
const ll INF = 1e18;
tcT> struct SegTree {
const T ID = -INF; T comb(T a, T b) { return max(a,b); }
int N; V<T> seg;
void init(int _N) { for(N = 1;N<_N;) N*=2; seg.assign(2*N, ID); }
void pull(int p) { seg[p] = comb(seg[p<<1], seg[p<<1|1]); }
void upd(int p, T val) {
seg[p += N] = val;
for(p >>= 1; p>0; p>>=1) pull(p);
}
T query(int l, int r) {
T ra = ID, rb = ID;
for(l += N, r += N+1; l<r; l>>=1, r>>=1) {
if(l&1) ra = comb(ra, seg[l++]);
if(r&1) rb = comb(seg[--r], rb);
}
return comb(ra, rb);
}
};
const int MX = 3e5+5;
int N, M;
V<pair<int,ll>> evn[MX];
multiset<ll> s;
void solve() {
cin>>N>>M;
F0R(i,M) {
int l, r, x;
cin>>l>>r>>x;
evn[l].pb({1, x - l});
evn[r+1].pb({0, x - l});
}
FOR(i,1,N+1) {
each(val, evn[i]) {
if(val.first) s.insert(val.second);
else s.erase(s.find(val.second));
}
if(s.empty()) cout << "0 ";
else cout << *s.rbegin() + i << " ";
}
cout << nl;
}
int main() {
setIO();
int t=1;
//cin>>t;
while(t-->0) {
solve();
}
return 0;
}
