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

def solve(S,T,N):
    l=0; r=1<<N
    while r-l>1:
        mid=(l+r)>>1

        if T<=mid:
            r=mid
        elif mid<=S:
            l=mid
        else:
            break

    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)))