#include <bits/stdc++.h>
using namespace std;
const int maxi = 1000 * 100 * 3 + 100;
bool mark[maxi];
vector<int> dosh[maxi];
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    int k, p;
    cin >> k >> p;
    dosh[k].push_back(p);
    dosh[p].push_back(k);
  }
  for (int q = 1; q <= 10; q++)
    for (int i = 1; i <= n; i++) {
      int p = dosh[i].size();
      for (int j = 0; j < dosh[i].size(); j++) p -= mark[dosh[i][j]];
      if (p > 1)
        mark[i] = 1;
      else
        mark[i] = 0;
    }
  for (int i = 1; i <= n; i++) cout << mark[i];
  cout << endl;
  return 0;
}
