//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 2005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

int t, n,  m;
int f[1005][1005];
int bst[1005][1005];

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
}

void proc()
{
    cin >> t;
    for(int i=1; i<=1000; i++) f[1][i] = i;
    for(int i=1; i<=1000; i++) f[i][1] = 1, f[i][0] = 0;
    int res;
    for(int i=2; i<=1000; i++)
    {
        for(int j=2; j<=1000; j++)
        {
            f[i][j] = INT_MAX;
            if (i > 3 && bst[i-1][j] == bst[i-2][j] && bst[i-2][j] == bst[i-3][j])
            {
                int k = bst[i-1][j];
                bst[i][j] = k;
                f[i][j] = max(f[i][j-k],f[i-1][k-1])+1;
            }
            else for(int x=1; x<=j; x++)
            {
                res = max(f[i][j-x],f[i-1][x-1]);
                if (res < f[i][j]-1)
                {
                    f[i][j] = res+1;
                    bst[i][j] = x;
                }
            }
        }
    }
    while (t--)
    {
        cin >> n >> m;
        cout << f[n][m] << endl;
    }
}

signed main()
{
    readfile();
    proc();
    return 0;
}