#include <bits/stdc++.h>
using namespace std;
int seg[1200000];
void build(int v, int l, int r) {
if (l == r) {
seg[v] = 0;
return;
}
int mid = (l + r) / 2;
build(2 * v, l, mid);
build(2 * v + 1, mid + 1, r);
seg[v] = 0;
}
void update(int v, int l, int r, int x, int y, int f) {
if (l == x && r == y) {
seg[v] = max(seg[v], f);
return;
}
int mid = (l + r) / 2;
if (y <= mid) {
update(2 * v, l, mid, x, y, f);
} else {
if (x > mid) {
update(2 * v + 1, mid + 1, r, x, y, f);
} else {
update(2 * v, l, mid, x, mid, f);
update(2 * v + 1, mid + 1, r, mid + 1, y, f + (mid - x + 1));
}
}
}
int query(int v, int l, int r, int pos, int ans) {
if(seg[v]>0) {
ans = max(ans, seg[v] + (pos - l));
}
if (l == r) return ans;
int mid = (l + r) / 2;
if (pos <= mid) {
return query(2 * v, l, mid, pos, ans);
} else {
return query(2 * v + 1, mid + 1, r, pos, ans);
}
}
int main() {
int m, n; cin >> n >> m;
build(1, 1, n);
for (int i = 1; i <= m; i++) {
int l, r, x;
cin >> l >> r >> x;
update(1, 1, n, l, r, x);
}
for (int i = 1; i <= n; i++) {
cout << query(1, 1, n, i, 0) << " ";
}
cout << '\n';
}
