#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=(b-1);i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

int main() {
  ll n,m;
  cin>>n>>m;
  vector<vector<ll> > vv(n,vector<ll>());
  rep(i,0,m){
    ll a,b;
    cin>>a>>b;
    vv[a].pb(b);
    vv[b].pb(a);
  }
  per(i,0,vv.sz){
    sort(all(vv[i]));
    reverse(all(vv[i]));
  }
  ll d[100100];
  clr(d,0);
  per(i,0,vv.sz){
    rep(j,0,vv[i].sz){
      if(i>vv[i][j])break;
      if(d[vv[i][j]]==0){
        d[i] = 1;
        break;
      }
    }
  }
  rep(i,0,vv[0].sz){
    if(d[vv[0][i]]==0){
      d[0] = 1;
    }
  }
  ll flag = 0;
  per(i,0,n){
    if(d[i]==1)flag = 1;
    if(flag==1){
      cout << d[i];
    }
  }
  cout << endl;
  return 0;
}