for i in range(0,int(input())):
count=0
n,k=map(int,input().split())
if(n<k or k==1):
print(n)
else:
while(n>0):
r=n%k
if(r>0):
n=n-r
count+=r
else:
n=n//k
count+=1
print(count)#include <iostream>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
long long int n, k;
cin >> n >> k;
long long int h = 0;
while (n > 0)
{
if (n % k != 0)
{
h += (n % k);
n = n - (n%k);
}
else
{
n = n / k;
h++;
}
}
cout << h << endl;
}
}1277A - Happy Birthday Polycarp | 577A - Multiplication Table |
817C - Really Big Numbers | 1355A - Sequence with Digits |
977B - Two-gram | 993A - Two Squares |
1659D - Reverse Sort Sum | 1659A - Red Versus Blue |
1659B - Bit Flipping | 1480B - The Great Hero |
1519B - The Cake Is a Lie | 1659C - Line Empire |
515A - Drazil and Date | 1084B - Kvass and the Fair Nut |
1101A - Minimum Integer | 985D - Sand Fortress |
1279A - New Year Garland | 1279B - Verse For Santa |
202A - LLPS | 978A - Remove Duplicates |
1304A - Two Rabbits | 225A - Dice Tower |
1660D - Maximum Product Strikes Back | 1513A - Array and Peaks |
1251B - Binary Palindromes | 768B - Code For 1 |
363B - Fence | 991B - Getting an A |
246A - Buggy Sorting | 884A - Book Reading |