#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<bitset>
#include<random>
#define INF 1000000000ll
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=(ll)a.size()-1) cout<<" "; else cout<<endl; }
#define ALL(v) v.begin(),v.end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll n,m;
	cin>>n>>m;
	vector<set<ll>> adj(n);
	REP(i,m) {
		ll a,b;
		cin>>a>>b;
		adj[a].insert(b);
		adj[b].insert(a);
	}
	vector<bool> used(n,false);
	string ans;
	for(ll i=n-1; i>=0; i--) {
		bool d=false;
		for(auto x: adj[i]) {
			if(x>i&&!used[x]) d=true;
		}
		if(d) {
			used[i]=true;
			ans+="1";
		} else ans+="0";
	}
	while(ans!="0"&&ans[0]=='0') ans=ans.substr(1,(ll)ans.size()-1);
	cout<<ans<<endl;
}