#include <bits/stdc++.h>
using namespace std;
int main(){
    int N;
    cin >> N;
    int Q;
    cin >> Q;
    vector<long long> ni(N + 1);
    ni[0] = 1;
    for(int i = 1; i <= N; i++) ni[i] = ni[i - 1] * 2;
    while(Q--){
        long long S, T;
        cin >> S >> T;
        int id = -1;
        bool f = true;
        int ans = 0;
        while(S < T){
            int pre = id;
            for(int i = id; i < N; i++){
                if(S % ni[i + 1] == 0 && S + ni[i + 1] <= T){
                    id = i + 1;
                }
            }
            if(pre == id) break;
            else {
                ans++;
                S += ni[id];
            }
        }
        long long rest = T - S;
        while(rest){
            if(rest & 1) ans++;
            rest >>= 1;
        }
        cout << ans << endl;
    }
}