#include <bits/stdc++.h> using namespace std; #define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define rep(i,n) repl(i,0,n) #define mp(a,b) make_pair((a),(b)) #define pb(a) push_back((a)) #define all(x) (x).begin(),(x).end() #define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x)) #define fi first #define se second #define dbg(x) cout<<#x" = "<<((x))<<endl template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;} template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;} #define INF 2147483600 #define long long long int main(){ int n,m; cin>>n>>m; vector<pair<int,int> > vec(m); rep(i,m){ int a,b; cin>>a>>b; if(a<b) swap(a,b); vec[i]=mp(a,b); } // firstのほうが必ず大きい vector<bool> used(n, false); sort(all(vec), greater<pair<int,int>>()); rep(i,m){ int a=vec[i].fi, b=vec[i].se; if(used[a] || used[b]) continue; used[b]=true; } int i=n-1; while(i>0 && used[i]==false)i--; while(i>=0) cout<<used[i--]; cout<<endl; return 0; }