#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <iomanip>
#include <cmath>
#include <map>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);++i)
#define rep(i,a,b) for(int i=a;i<(b);++i)
using ll = long long;
constexpr ll INF = 1LL << 60;
constexpr int MOD = 998244353;

ll q, n, k;

int main() {
  cin.tie(0); ios_base::sync_with_stdio(false); 
  cin >> q;
  REP(i, q) {
    cin >> n >> k;
    if(k == 1) cout << n-1;
    else {
      ll ans = 0, h = 1;
      while(h < n) {
        h *= k;
        ++ans;
      }
      cout << ans;
    }
    cout << '\n';
  }
  return 0;
}