#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
using mint=modint998244353;
int n;
int solve(ll s, ll t, ll a=0, ll b=(1ll<<n)){
    if(s<=a && b<=t)return 1;
    if(s>=b || a>=t)return 0;
    return solve(s, t, a, (a+b)/2)+solve(s, t, (a+b)/2, b);
}
int main()
{
    int q;
    cin>>n>>q;
    while(q--){
        ll s, t;
        cin>>s>>t;
        cout<<solve(s, t)<<endl;
    }
    return 0;
}