#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    ll N, Q, S, T, ans;
    cin >> N >> Q;

    while(Q){
        Q--;
        ans = 0;
        cin >> S >> T;
        while(S != T){
            for (int i=N; i>=0; i--){
                if ((S&((1LL<<i)-1))==0 && S+(1LL<<i) <= T){
                    S += (1LL<<i);
                    ans++;
                    break;
                }
            }
        }
        cout << ans << endl;
    }

    return 0;
}