package yukicodercontest155;

import java.util.*;
public class D{
	static Scanner s = new Scanner(System.in);
	public static void main(String[] args) {
		int n=s.nextInt(),m=s.nextInt();
		BitSet b=new BitSet(n);
		PriorityQueue<Edge> queue = new PriorityQueue<>();
		for(int i=0;i<m;i++) {
			queue.add(new Edge(s.nextInt(), s.nextInt()));
		}
		boolean buf;
		for(int i=n-1;i>=0;i--) {
			buf=b.get(i);
			while((!queue.isEmpty())&&i==queue.peek().t) {
				if(!buf)
					b.set(queue.poll().s);
				else
					queue.poll();
			}
		}
		for(int i=b.previousSetBit(114514);i>=0;i--) {
			System.out.print(b.get(i)?1:0);
		}
		System.out.println();
	}
}
class Edge implements Comparable<Edge>{
	int s,t;
	Edge(int s,int t) {
		this.s=s;
		this.t=t;
	}
	@Override
	public int compareTo(Edge o) {
		return o.t-this.t;
	}
	@Override
	public String toString() {
		return ""+s+" "+t;
	}
}