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.
# Lang: pypy3.6-v7.1.0-win32\pypy3.exe
# Problem Name: FromZeroToHero
# Problem Serial No: 1175
# Problem Type: A
# Problem Url: https://codeforces.com/contest/1175/problem/A 
# Solution Generated at: 2019-06-06 00:51:34.101810 UTC


def r(a, x):
    a, b = divmod(a, x)
    count = 0
    while a >= x:
        count += b + 1
        a, b = divmod(a, x)
    return count, a, b


tc = int(input())
for _ in range(tc):
    a, x = map(int, input().split())
    c, d, e = r(a, x)
    print(e) if c == 0 and d == 0 else print(c + d + e + 1)

# Accepted
