#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << (x) << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010


int main(){
  int n,m;
  int a,b;
  vector<pair<int,int> > vec;
  
  scanf("%d%d",&n,&m);

  for(int i=0;i<m;i++){
    scanf("%d%d",&a,&b);
    vec.emplace_back(min(a,b),max(a,b));
  }

  sort(vec.begin(),vec.end());

  bool f[SIZE] = {};
  
  for(int i=m-1;i>=0;i--){
    if(f[vec[i].first] || f[vec[i].second]) continue;

    f[vec[i].first] = true;
  }

  string ans,buf;

  for(int i=0;i<n;i++){
    if(f[i]){
      ans = "1" + buf + ans;
      buf = "";
    }else{
      buf = "0" + buf;
    }
  }

  cout << ans << endl;
  
  return 0;
}