#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, q; cin >> n >> q;
  while (q--) {
    ll s, t; cin >> s >> t;
    int b = n;
    for (; b >= 0; --b) {
      if ((s >> b & 1) != (t >> b & 1)) break;
      if (s >> b & 1) {
        s ^= 1LL << b;
        t ^= 1LL << b;
      }
    }
    int ans = 0;
    for (int lsb = (s == 0 ? b : __builtin_ctzll(s)); lsb <= b; ++lsb) {
      ans += (s >> lsb & 1) == 0;
    }
    t ^= 1LL << b;
    ans += __builtin_popcountll(t);
    cout << ans << '\n';
  }
  return 0;
}