From Hero to Zero
You are given an integer $$$n$$$ and an integer $$$k$$$.In one step you can do one of the following moves:   decrease $$$n$$$ by $$$1$$$;  divide $$$n$$$ by $$$k$$$ if $$$n$$$ is divisible by $$$k$$$. For example, if $$$n = 27$$$ and $$$k = 3$$$ you can do the following steps: $$$27 \rightarrow 26 \rightarrow 25 \rightarrow 24 \rightarrow 8 \rightarrow 7 \rightarrow 6 \rightarrow 2 \rightarrow 1 \rightarrow 0$$$.You are asked to calculate the minimum number of steps to reach $$$0$$$ from $$$n$$$. 
Steps for the first test case are: $$$59 \rightarrow 58 \rightarrow 57 \rightarrow 19 \rightarrow 18 \rightarrow 6 \rightarrow 2 \rightarrow 1 \rightarrow 0$$$.In the second test case you have to divide $$$n$$$ by $$$k$$$ $$$18$$$ times and then decrease $$$n$$$ by $$$1$$$.
The first line contains one integer $$$t$$$ ($$$1 \le t \le 100$$$) — the number of queries.The only line of each query contains two integers $$$n$$$ and $$$k$$$ ($$$1 \le n \le 10^{18}$$$, $$$2 \le k \le 10^{18}$$$).
For each query print the minimum number of steps to reach $$$0$$$ from $$$n$$$ in single line. 
import sys

def main():
    k = int(input())
    for _ in range(k):
        (n, m) = map(int, input().split())
        ans = 0
        while n:
            r = n % m
            if r:
                ans += r
                n -= r
            else:
                ans += 1
                n //= m
        print(ans)
if __name__ == '__main__':
    main()
for q in range(int(input())):
    (n, k) = list(map(int, input().split()))
    count = 0
    while n > 0:
        if n % k == 0:
            n //= k
            count += 1
        else:
            l = n % k
            n -= l
            count += l
    print(count)
for _ in range(int(input())):
    (n, k) = map(int, input().split())
    count = 0
    while n > 0:
        if n % k == 0:
            n = n // k
            count += 1
        else:
            count += n % k
            n -= n % k
    print(count)