#include <iostream>
#include <algorithm>
using namespace std;
using i64 = long long;

int main(void) {
  int n, m; scanf("%d%d", &n, &m);
  vector<vector<int>> G(n, vector<int>()); // G[n][]
  for(int i=0; i<m; ++i) {
    int a, b; scanf("%d%d", &a, &b);
    G[a].push_back(b);
    G[b].push_back(a);
  }
  string removed(n, '0');
  for(int i=n-1; i>=0; --i) {
    if(removed[i] == '1') { continue; }
    for(int u : G[i]) {
      removed[u] = '1';
    }
  }
  reverse(begin(removed), end(removed));
  removed.erase(0, removed.find_first_not_of('0'));
  cout << removed << endl;
  return 0;
}