import java.util.*;

public class Main {
	public static void main (String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		ArrayList<HashSet<Integer>> graph = new ArrayList<>();
		for (int i = 0; i < n; i++) {
		    graph.add(new HashSet<>());
		}
		for (int i = 0; i < m; i++) {
		    int a = sc.nextInt();
		    int b = sc.nextInt();
		    graph.get(a).add(b);
		    graph.get(b).add(a);
		}
		boolean[] needs = new boolean[n];
		for (int i = n - 1; i >= 0; i--) {
		    if (needs[i]) {
		        continue;
		    } else {
		        if (graph.get(i).size() == 0) {
		            continue;
		        }
		        for (int x : graph.get(i)) {
		            needs[x] = true;
		            for (int y : graph.get(x)) {
		                if(i == y) {
		                    continue;
		                }
		                graph.get(y).remove(x);
		            }
		            graph.get(x).clear();
		        }
		        graph.get(i).clear();
		    }
		}
		StringBuilder sb = new StringBuilder();
		boolean isFirst = true;
	    for (int i = n - 1; i >= 0; i--) {
	        if (needs[i]) {
	            sb.append("1");
	            isFirst = false;
	        } else if (!isFirst) {
	            sb.append("0");
	        }
	    }
		System.out.println(sb);
	}
}