#include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#define pb push_back
#define pii pair<int,int>
using namespace std;


int main(void){
  int n,m;
  int a,b,i,j;
  vector<vector<int> >edge;

  cin>>n>>m;
  int use[n];
  for(i=0;i<n;i++){
    vector<int> x;
    edge.pb(x);
    use[i]=0;
  }
  for(i=0;i<m;i++){
    cin>>a>>b;
    edge[a].pb(b);
    edge[b].pb(a);
  }
  
  for(i=n-1;i>=0;i--){
    if(edge[i].size()!=0 && use[i]==0){
      use[i]=-1;
      for(j=0;j<edge[i].size();j++){
        use[edge[i][j]]=1;
        auto itr=find(edge[edge[i][j]].begin(),edge[edge[i][j]].end(),i);
        if(itr!=edge[edge[i][j]].end()) edge[edge[i][j]].erase(itr);
      }
    }
    
  }
  /*
  cout<<endl;
  for(i=0;i<n;i++){
    cout<<i<<":";
    for(j=0;j<edge[i].size();j++){
      cout<<edge[i][j]<<" ";
    }
    cout<<endl;
  }
  */
  j=0;
  for(i=n;i>=0;i--){
    if(use[i]==1) j=1;
    if(use[i]==1&&j==1) cout<<1;
    if(use[i]!=1&&j==1) cout<<0;
  }
  cout<<endl;


  return 0;
}