#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e9;
const ll MOD = 1e9 + 7;

void solve(){
    ll n, k;
    cin >> n >> k;

    int ans = 0;
    ll x = 1;
    while(n-x > 0){
        n -= x;
        x *= k;
        ans++;
    }

    cout << ans << endl;
}

int main(){
    int q;
    cin >> q;
    rep(i, q) solve();
}