def solve(n, q, st):
    answer = []
    for s, t in st:
        ans = 0
        term = 0
        k=1<<N
        while not((T-1)//k > (S-1)//k):
            k>>=1
        mid=k*((S+k-1)//k)
        ans = bin(mid - s).count('1') + bin(t - mid).count('1')
        answer.append(ans)
    return answer


n, q = map(int,input().split())
st = [list(map(int,input().split())) for _ in range(q)]
answer = solve(n, q, st)

for i in answer:
    print(i)