#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout<<"["<<#HEHE<<"] : ",dout(HEHE)
void dout(){cout<<'\n';}
template<typename T,typename...U>
void dout(T t,U...u){cout<<t<<(sizeof...(u)?", ":""),dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false),cin.tie(0)
#define FOR(x,a,b) for(int x=a,I=b;x<=I;x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 1e4 + 5;

int n, k;
int a[SIZE][SIZE];
bitset<SIZE> dir[SIZE];

void solve() {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) fill (a[i], a[i] + n + 1, 0);
    k--;
    a[1][1] = k;
    for (int i = 1; i <= n; i++) for (int j = 1; j <= n - i; j++) {
        dir[i][j] = a[i][j] & 1;
        a[i + 1][j] += (a[i][j] + 1) >> 1;
        a[i][j + 1] += a[i][j] >> 1;
    }
    int x = 1, y = 1;
    while (x + y <= n) {
        if (dir[x][y]) y++;
        else x++;
    }
    cout << n - x << '\n';
}

int32_t main() {
    Waimai;
    int tt;
    cin >> tt;
    while (tt--) solve();
}