def solve(s, t, n):
    mid = 0
    for i in range(n + 1):
        if (s - 1) // (1 << i) != (t - 1) // (1 << i):
            mid = (1 << i) * (t // (1 << i))
    return str(bin(mid - s)).count('1') + str(bin(t - mid)).count('1')


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

for _ in range(q):
    s, t = map(int,input().split())
    print(solve(s, t, n))