#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, q; cin >> n >> q;
	while (q--) {
		long long  s, t; cin >> s >> t;
		vector<long long>v;
		rep(i, n + 1) {
			long long pow2 = 1LL << i;
			long long l = ((s + pow2 - 1) / pow2)*pow2;
			long long r = (t / pow2)*pow2;
			if (l > r) continue;
			v.push_back(l);
			v.push_back(r);
			//cout << l << " " << r << endl;
		}
		sort(all(v));
		v.erase(unique(all(v)), v.end());
		cout << v.size() - 1 << endl;
	}
	return 0;
}