#include<bits/stdc++.h>
using namespace std;
#define N 1000100
typedef long long ll;
int n,m,l[N],r[N],ans[N];
ll w[N];
void Solve(int z){
	static int s[N],p[N],ok[N];
	static int tot;
	tot=0;
	for(int i=1;i<=n;++i)s[i]=ok[i]=0;
	for(int i=1;i<=m;++i){
		if(w[i]>>z&1){
			++s[l[i]],--s[r[i]+1];
		}
	}
	for(int i=1;i<=n;++i){
		s[i]+=s[i-1];
		if(!s[i]){
			ok[i]=1;
		}
		else if(s[i]==1){
			p[++tot]=i;
		}
	}
	for(int i=1;i<=n;++i){
		ok[i]+=ok[i-1];
	}
	int liml=n,limr=1;
	int jb=0,wei=0;
	for(int i=1;i<=m;++i){
		if(!(w[i]>>z&1)){
			if(ok[r[i]]-ok[l[i]-1]>0)continue;
			++wei,jb=i;
			int L=lower_bound(p+1,p+tot+1,l[i])-p;
			int R=upper_bound(p+1,p+tot+1,r[i])-p-1;
			liml=min(liml,R),limr=max(limr,L);
		}
	}
	for(int i=1;i<=m;++i){
		if(w[i]>>z&1){
			int L=lower_bound(p+1,p+tot+1,l[i])-p;
			int R=upper_bound(p+1,p+tot+1,r[i])-p-1;
			if(L>liml||R<limr){
				ans[i]=0;
			}
		}
		else{
			if(wei>1||(wei==1&&jb!=i)){
				ans[i]=0;
			}
		}
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n>>m;
	for(int i=1;i<=m;++i){
		cin>>l[i]>>r[i]>>w[i];
		ans[i]=1;
	}
	for(int i=0;i<60;++i){
		Solve(i);
	}
	for(int i=1;i<=m;++i){
		cout<<ans[i];
	}
	return 0;
}