#include<bits/stdc++.h>
#define int long long
const int inf=8938103643641919514ll;
const int mod=1000000007ll;
const int dd[]={0,-1,0,1,0};
using namespace std;
int a,b,c,d;
struct Node{
	unordered_set<int> e;
};
Node *p;
bitset<114514> q;
signed main(){
	int i,j,k;
	cin>>a>>b;
	p=new Node[a];
	for(i=0;i<b;i++){
		int u,v;
		cin>>u>>v;
		p[u].e.insert(v);
		p[v].e.insert(u);
	}
	string ans;
	for(i=a-1;i>=0;i--){
		if(!q[i]){
			for(auto x:p[i].e)
				q.set(x);
		}
		ans.push_back(q[i]?'1':'0');
	}
	ans=ans.substr(ans.find('1'));
	cout<<ans<<endl;
}