//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[i][0] = inf;
    for(int i=0; i<=1000; i++) f[0][i] = 0;
    for(int k=1; k<=1000; k++)
    {
        for(int n=1; n<=1000; n++)
        {
            int l=1;
            int r=n;
            while (r-l>=2)
            {
                int mid = (r+l)/2;
                if (f[mid-1][k-1] > f[n-mid][k]){
                    r = mid;
                }
                else if (f[mid-1][k-1] < f[n-mid][k])
                {
                    l = mid;
                }
                else{
                    l=mid;
                    r=mid;
                }
            }
            f[n][k] = min( max(f[l-1][k-1],f[n-l][k]), max(f[r-1][k-1],f[n-r][k]) ) + 1;
        }
    }
    while (t--)
    {
        cin >> n >> m;
        cout << f[m][n] << endl;
    }
}

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