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

def cost(l, r, i):
  if i <= 0:
    return r - l
  else:
    cur = i
    while cur > 0 and r // (1 << cur) - (l - 1) // (1 << cur) < 2:
      cur -= 1

    u = ((l + (1 << cur) - 1) // (1 << cur)) * (1 << cur)
    v = (r // (1 << cur)) * (1 << cur)
    return cost(l, u, cur - 1) + (v - u) // (1 << cur) + cost(v, r, cur - 1)

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