popcount=lambda x:bin(x).count("1")

def solve(S,T,N):
    k=1<<N
    while not((T-1)//k > (S-1)//k):
        k>>=1

    mid=k*((S+k-1)//k)
    return popcount(mid-S)+popcount(T-mid)

#================================================
import sys
input=sys.stdin.readline
write=sys.stdout.write

N,Q=map(int,input().split())

Max=1<<N
Ans=[0]*Q
for quest in range(Q):
    S,T=map(int,input().split())
    Ans[quest]=solve(S,T,N)

write("\n".join(map(str,Ans)))