#include<algorithm>
#include<bitset>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<cmath>
#include<complex>
#include<csignal>
#include<csetjmp>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cwchar>
#include<cwctype>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
//#include<windows.h>

#define fir first
#define sec second
#define lc(p) p<<1
#define rc(p) p<<1|1
#define lowbit(p) p & (~p)
#define gc getchar
#define pc putchar
#define pq priority_queue
#define pb push_back
#define mp make_pair
#define re register
#define IO  ios::sync_with_stdio(0);\
			cin.tie(0);\
			cout.tie(0);
#define ns puts("NO SOLUTION");
#define im puts("Impossible");
#define endl '\n'
#define pcn putchar('\n')
#define pck putchar(' ')
#define pce putchar('.');
#define YES puts("YES")
#define yyes puts("yes")
#define Yes puts("Yes")
#define NO puts("NO")
#define noo puts("no")
#define No puts("No")
#define wT while(T--)
//#define int long long

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef double db;

const int MAXN=1010;
const int MAXM=10010;
const int mod=998244353;
//const int mod=1000000007;
//const int mod=1000000003;

struct node{
	int v,w;
	node(int _v,int _w){
		v=_v;
		w=_w;
	}
};

struct SMT{
	int l,r;
	int sum;
};

inline void free(){
	freopen("xxx.in","r",stdin);
	freopen("xxx.out","w",stdout);
}

inline int read(){
	int x=0,k=1;
	char ch=gc();
	while(!isdigit(ch) && ch!='-')ch=gc();
	if(ch=='-'){
		k=-1;
		ch=gc();
	}
	while(isdigit(ch)){
		x=(x<<3)+(x<<1)+(ch^48);
		ch=gc();
	}
	return x*k;
}

inline void print(int x){
	if(x<0){
		pc('-');
		x=-x;
	}
	if(x<10){
		pc(x^48);
		return;
	}
	print(x/10);
	pc(x%10^48);
}

int ksm(int x,int n){
	int res=1,a=x;
	while(n){
		if(n&1)res=res*a%mod;
		a=a*a%mod;
		n>>=1;
	}
	return res;
}

int ans[300300],jump[300300];
int n,m;
int l,r,x;

int find(int x){
	if(jump[x]!=x)jump[x]=find(jump[x]);
	return jump[x];
}
signed main(){
	//free();
	n=read(),m=read();
	for(int i=1;i<=n+200;i++)jump[i]=i;
	for(int i=1;i<=m;i++){
		l=read(),r=read(),x=read();
		for(int i=find(l);i<=r;i=find(i+1)){
			if(i!=x){
				jump[i]=i+1;
				ans[i]=x;
			}
		}
	}
	for(int i=1;i<=n;i++)print(ans[i]),pck;
	return 0;
}

内外循环都是 $i$ ，为什么能过》》》