using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class TEST{
	static void Main(){
		Sol mySol =new Sol();
		mySol.Solve();
	}
}

class Sol{
	public void Solve(){
		
		Pair[] P = new Pair[M];
		for(int i=0;i<M;i++){
			P[i] = new Pair(A[i],B[i]);
		}
		//Array.Sort(P,(p,q) => p.B.CompareTo(q.B) == 0 ? p.A.CompareTo(q.A) : p.B.CompareTo(q.B));
		//Array.Reverse(P);
		
		var H = new HashSet<int>();
		for(int i=0;i<M;i++){
			if(H.Contains(P[i].A) || H.Contains(P[i].B)) continue;
			 H.Add(P[i].A);
		}
		
		var LL = new LinkedList<char>();
		for(int i=0;i<N;i++){
			LL.AddFirst(H.Contains(i) ? '1' : '0');
		}
		while(LL.First.Value == '0') LL.RemoveFirst();
		Console.WriteLine(new String(LL.ToArray()));
		
		
	}
	
	class Pair{
		public int A,B;
		public Pair(int a, int b){
			A = a; B = b;
		}
	}
	
	int N,M;
	int[] A,B;
	public Sol(){
		var d = ria();
		N = d[0]; M = d[1];
		A = new int[M];
		B = new int[M];
		for(int i=0;i<M;i++){
			d = ria();
			Array.Sort(d);
			A[i] = d[0]; B[i] = d[1];
		}
	}

	static String rs(){return Console.ReadLine();}
	static int ri(){return int.Parse(Console.ReadLine());}
	static long rl(){return long.Parse(Console.ReadLine());}
	static double rd(){return double.Parse(Console.ReadLine());}
	static String[] rsa(char sep=' '){return Console.ReadLine().Split(sep);}
	static int[] ria(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>int.Parse(e));}
	static long[] rla(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>long.Parse(e));}
	static double[] rda(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>double.Parse(e));}
}