#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 f(ll n, ll x) {
    // cout << n _ x << endl;
    if (x > 63 || (1ll<<x) >= n) return 1;
    if (n > 2 && x == 1) return oo;
    if (ans[{n,x}]) return ans[{n,x}];
    ll sum = 1;
    ll ret = oo;
    for (int k = 1;k < x; ++k) {
        sum += c[x][k];
        if (n % sum == 0) ret = min(ret, f(n/sum, x-k) + 1);
        else if (n - n/sum * (sum-1) == n/sum + 1) ret = min(ret, f(n/sum,x-k) + 1);
        else ret = min(ret, f((n+sum-1)/sum, x-k) + 1);
    }
    ans[{n,x}] = ret;
    // cout << n _ x _ ret << endl;
    return ret;
}

ll n, d;

void run_case() {
    cin >> n >> d;
    for (int x = 1;x <= 64; ++x) if (f(n,x) <= d) {
        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;
}