#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;

using i64 = long long;
constexpr int N_MAX = 1e4;
int dp[2][N_MAX];

void solve(){
    int n,k; cin >> n >> k;
    if(k==1){
        cout << 0 << '\n';
        return;
    }
    for(int i = 0; i < 2; i++) {
        for(int j = 0; j < n; j++) {
            dp[i][j] = 0;
        }
    }
    dp[0][0] = k-1;
    int y=0,x=0;
    for(int d=0;d<n-1;d++){
        int c =  d&1;
        if(dp[c][x]%2==0) y++;
        else x++;
        for(int i=0;i<=d;i++){
            dp[c^1][i] += (dp[c][i]+1)/2;
            dp[c^1][i+1] += (dp[c][i])/2;
        }
        rep(i,n) dp[c][i] = 0;
    }
    cout << x << '\n';
}

int main() {
    int T; cin >> T;
    while(T--) solve();
}