#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n,m;
vi g[125252];
pair<pii,int> yo[125252];
bool used[125252];
bool eee[125252];

int main(){
  scanf("%d%d",&n,&m);
  set<pair<pii,int>> S;
  REP(i,m){
    int a,b;
    scanf("%d%d",&a,&b);
    if(a>b)swap(a,b);
    yo[i] = make_pair(pii(a,b),i);
    g[a].push_back(i);
    g[b].push_back(i);
  }
  sort(yo,yo+m);
  reverse(yo,yo+m);
  REP(i,m){
    int a = yo[i].first.first;
    int b = yo[i].first.second;
    int id = yo[i].second;
    if(eee[id])continue;
    used[a] = true;
    for(int x : g[a])eee[x] = true;
  }
  bool lez=true;
  FORR(i,0,n){
    if(used[i])lez=false;
    if(!lez)putchar(used[i]?'1':'0');
  }
  puts("");
  return 0;
}