#include <bits/stdc++.h>
using namespace std;
#define _ <<" "<<
#define sz(x) ((int) (x).size())
typedef pair<int, int> pii;
typedef long long ll;
const int maxn = 5e5 + 5;
const ll oo = LLONG_MAX/2;
ll c[66][66];

map<pair<ll,ll>,ll> ans;
ll dp[65][65];

ll f(int x, int d) {
    if (d == 1) return 1ll<<x;
    if (x == 1) return 2; 
    if (dp[x][d]) return dp[x][d];
    ll sum = 1;
    for (int k = 1;k < x; ++k) {
        sum += c[x][k];
        ll nxt = f(x-k,d-1);
        if (nxt <= LLONG_MAX/sum)
            dp[x][d] = max(dp[x][d],  nxt * sum + 1);
    }
    return dp[x][d];
}

ll n, d;

void run_case() {
    cin >> n >> d;
    d = min(d, 63*1ll);
    for (int x = 1;x <= 63; ++x) {
        if (f(x,d) >= n) {
            cout << x << '\n';
            return;
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    c[0][0] = 1;
    for (int i = 1;i <= 64; ++i) {
        c[i][0] = 1;
        for (int j = 1;j <= 64; ++j) {
            c[i][j] = c[i-1][j-1] + c[i-1][j];
        }
    }
    int T; cin >> T;
    while (T--) run_case();
    return 0;
}