N,M = list(map(int, input().split(' ')))
G = [[] for _ in range(N)]
keep = [0 for _ in range(N)]

for m in range(M):
    a,b = list(map(int, input().split(' ')))
    G[min(a,b)].append(max(a,b))
        
for n in reversed(range(N)):
    for c in G[n]:
        if keep[c] == 0:
            keep[n] = 1

first = 1
for i in reversed(range(N)):
    if keep[i] == 0 and first == 1:
        continue
    first = 0
    print(keep[i], end='')
print()