#include<iostream>
#include<vector>
using namespace std;

// #define int long long
#define pii pair<int, int>
#define F first 
#define S second 
#define N 10005

int dp[10005][10005];
void solve(){
    int n, k;
    cin >> n >> k;
    dp[0][0] = k - 1;
    for (int tot = 0; tot < n - 1; tot++){
        for (int i = 0; i <= tot + 1; i++)
            dp[i][tot - i + 1] = 0;
        for (int i = 0; i <= tot; i++){
            int j = tot - i;
            dp[i + 1][j] += dp[i][j] / 2 + (dp[i][j] & 1);
            dp[i][j + 1] += dp[i][j] / 2;
        }
    }
    int nowi = 0, nowj = 0;
    for (int t = 0; t < n - 1; t++){
        if(dp[nowi][nowj] & 1)
            nowj++;
        else
            nowi++;
    }
    cout << nowj << "\n";
}
signed main(){
    ios_base::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    cin >> t;
    while(t--)
        solve();
    return 0;
}