import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


int N, M;
int[] A, B;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      A = new int[M];
      B = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt();
        B[i] = readInt();
      }
      
      auto G = new int[][N];
      foreach (i; 0 .. M) {
        if (A[i] > B[i]) {
          swap(A[i], B[i]);
        }
        G[B[i]] ~= A[i];
      }
      auto ans = new bool[N];
      foreach_reverse (u; 0 .. N) {
        if (!ans[u]) {
          foreach (v; G[u]) {
            ans[v] = true;
          }
        }
      }
      foreach_reverse (u; 0 .. N) {
        if (ans[u]) {
          foreach_reverse (v; 0 .. u + 1) {
            write(ans[v] ? 1 : 0);
          }
          writeln;
          break;
        }
      }
    }
  } catch (EOFException e) {
  }
}