#include <iostream>
using namespace std;

int solve(long long int s, long long int t, int n){
    long long int k = 1<<n;
    while (!((t - 1) / k > (s - 1) / k)){
        k /= 2;
    }
    long long int mid = ((s+k-1)/k) * k;
    return __builtin_popcountll(mid - s) + __builtin_popcountll(t - mid);
}
int main(void){
    int n, q;

    cin >> n >> q;
    
    for(int i = 0; i < q; i++){
        long long int s, t;
        cin >> s >> t;
        cout << solve(s, t, n) << endl;
    }
    
    return 0;
}