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.
import java.util.Scanner;


public class From_Hero_To_Zero {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		
		/*
		 * 
		 * 
		 * Given two integers n, k. 
		 *  1 <= n <= 10^18
		 *  2 <= k <= 10^18
		 *  
		 *  At Each step you can do one of the following operations
		 *  
		 *  
		 *  1. subtract 1 from n
		 *  2. divide n by k if n is divisible by k
		 *
		 *  Convert n to 0 in minimum possible steps. Print this minimum steps for given n,k.
		 *  
		 *  Test case 1. n = 25, k = 4
		 *  
		 *  25 -> 24 -> 6 -> 5 -> 4 -> 1 -> 0 // 6 steps
		 *  
		 *  Test case 2. n = 1000, k = 3
		 *  
		 *  1000 -> 999 -> 333 -> 111 -> 37 -> 36 -> 12 -> 4 -> 3 -> 1 -> 0 // 10 steps
		 */
		
		
		
		
		Scanner sc = new Scanner(System.in);
		
		long n,k,t;
		
		t = sc.nextInt();
		
		
		while(t > 0)
		{
			
			long steps = 0;
			n = sc.nextLong();
			k = sc.nextLong();
			
			while(n > 0)
			{
				//System.out.print(n + " --> ");
				if(n % k == 0)
					{
						steps++;
						n /= k;
					}
				else
					{
						steps += n%k;
						n -= n%k;
					}
				
				//steps++;
			}
			
			/*System.out.print( " 0");
			System.out.println();
			*/
			System.out.println(steps);
			
			t--;
		}
		

	}	

}
