import sys

input = sys.stdin.buffer.readline


def solve(S, T):
    res = 0
    b = 0
    while S + (1 << b) <= T:
        if (S >> b) & 1:
            S += (1 << b)
            res += 1
        b += 1
    res += bin(T - S).count("1")
    return res


N, Q = map(int, input().split())
for _ in range(Q):
    print(solve(*map(int, input().split())))