# snippet: interactive_
# Last Modified: 2026-02-13

from collections import deque, defaultdict
from itertools import permutations, product
from bisect import bisect_left, bisect_right
from heapq import heappush, heappop
from random import randint, shuffle
def II(): return int(input())
def LI(): return list(map(int,input().split()))
def LI_1(): return [int(x) - 1 for x in input().split()]
def SI(): return input()
def LS(): return list(input().split())
mod = 998244353
inf = 1<<61
EPS = 10 ** -6

def solve():
    N, M = LI()
    for i in range(M):
        a, b = LI()
        if a > b:
            print(0, flush=True)
        else:
            print(1, flush=True)
    return

if __name__ == "__main__":
    T = 1
    # T = II()
    for _ in range(T):
        solve()