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 → 26 → 25 → 24 → 8 → 7 → 6 → 2 → 1 → 0.

You are asked to calculate the minimum number of steps to reach 0 from n. 

Input

The first line contains one integer t (1 ≤ t ≤ 100) — the number of queries.

The only line of each query contains two integers n and k (1 ≤ n ≤ 10^{18}, 2 ≤ k ≤ 10^{18}).

Output

For each query print the minimum number of steps to reach 0 from n in single line. 

Example

Input


2
59 3
1000000000000000000 10


Output


8
19

Note

Steps for the first test case are: 59 → 58 → 57 → 19 → 18 → 6 → 2 → 1 → 0.

In the second test case you have to divide n by k 18 times and then decrease n by 1.
"""
lis=[]
n=int(input())
for i in range(n):
            l=[int(x) for x in input().split()]
            lis.append(l)
l=[]
for i in range(len(lis)):
            for j in range(len(lis[i])):
                        l.append(lis[i][j])
for i in range(n-1,0,-1):
            for j in range((i*(i-1))//2,(i*(i+1))//2,1):
                        l[j]+=max(l[j+i],l[j+i+1])
            
print(l[0])
"""
n=int(input())
while(n):
            n1,k=map(int,input().split())
            ans=0
            while(n1!=0):
                        ans+=n1%k
                        n1=n1//k
                        if(n1!=0):
                                    ans+=1
            print(ans)
            n-=1
