import sys
sys.setrecursionlimit(10**4)

n, m = map(int, input().split())

g = [[] for i in range(n)]

for _ in range(m):
    
    u, v = map(int, input().split())
    u -= 1
    v -= 1
    g[u].append(v)

    cycle = False
    def dfs(g, crr, visited, finished):
        visited[crr] = True
        for nxt in g[crr]:
            if not visited[nxt]:
                dfs(g, nxt, visited, finished)
            elif not finished[nxt]:
                global cycle
                cycle = True
        finished[crr] = True

    visited = [False] * n
    finished = [False] * n
    crr = u
    if not visited[crr]:
        dfs(g, crr, visited, finished)

    if cycle:
        g[u].pop(-1)
        g[v].append(u)
        print(1,flush=True)
    else:
        print(0,flush=True)