#include <bits/stdc++.h>
using namespace std;
#define EPS (1e-8)


int solve(long s, long t, long bin[]){
    int maxi = 32;
    int cnt = 0;
    while (s < t){
        for (int i = 32; i >= 0; i--){
            if ((s % bin[i] == 0) && (s + bin[i] <= t)){
                s += bin[i];
                cnt += 1;
                break;
            }
        }
    }
    return cnt;
}

int main(void){
    int n, q;
    cin >> n >> q;
    long bin[100];
    bin[0] = 1;
    for(int i = 1; i < 33; i++){
        bin[i] = bin[i - 1] * 2;
    }
    long maxi = pow(2, n);
    long s, t;
    for(int i = 0; i < q; i++){
        cin >> s >> t;
        cout << solve(s, t, bin) << endl;
    }
    return 0;
}