#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<numeric>
#include<string>
#include<stack>
#include<queue>
#include<string.h>
#include<array>
#include<climits>
#include<algorithm>
#include<cmath>
using namespace std;
#define ff first
#define int long long
#define ss second
const int mx = 150000;
#define ll long long
#define endl '\n'
struct ST{
int n;
vector<int> tree;
vector<int> lazy;
ST(int size){
n = size;
tree.resize(4 * n);
lazy.resize(4 * n);
}
void push(int node, int start, int end){
if(lazy[node] != 0){
tree[node] = lazy[node] * (end - start + 1);
if(start != end){
lazy[2 * node] += lazy[node];
lazy[2 * node + 1] += lazy[node];
}
lazy[node] = 0;
}
}
void update(int node, int start, int end, int l, int r, int val){
push(node, start, end);
if(start > r || end < l) return;
if(start >= l && end <= r){
lazy[node] = max(lazy[node], val);
push(node, start, end);
return;
}
int mid = (start + end) / 2;
update(2 * node, start, mid, l, r, val);
update(2 * node + 1, mid + 1, end, l, r, val);
tree[node] = tree[2 * node] + tree[2 * node + 1];
}
int query(int node, int start, int end, int id){
push(node, start, end);
if(start == end){
return tree[node];
}
else{
int mid = (start + end) / 2;
if(mid >= id){
return query(2 * node, start, mid, id);
}
else{
return query(2 * node + 1, mid + 1, end, id);
}
}
}
};
signed main(){
int n, m;
cin >> n >> m;
ST st(n);
for(int i = 0; i < m; i++){
int L, R, X;
cin >> L >> R >> X;
L--, R--;
st.update(1, 0, n - 1, L, R, X);
}
vector<int> g(n);
for(int i = 0; i < n; i++){
g[i] = st.query(1, 0, n - 1, i);
}
vector<int> new_g(n);
new_g[0] = g[0];
for(int i = 1; i < n; i++){
if(g[i] == g[i - 1]){
new_g[i] = new_g[i - 1] + 1;
}
else{
new_g[i] = g[i];
}
}
for(int i = 0; i < n; i++){
cout << new_g[i] << " ";
}
}
