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 _1175A_FromHeroToZero {
       private static Scanner sc;
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		int testcase = sc.nextInt();
		sc.nextLine();
		for(int i=0;i<testcase;i++) {
			String[] str = sc.nextLine().split(" ");
			long n = Long.parseLong(str[0]);
			long k = Long.parseLong(str[1]);
			long ans = n%k;
			n = n-n%k;
			//System.out.println(n);
			while(n>=k) {
				
				n = n/k;
				ans = ans+1;
				if(n<k) {
					break;
				}
				if(n%k!=0) {
					ans = ans+n%k;
					n = n-n%k;
					//System.out.println("p");
				}
			}
			ans = ans+n;
			System.out.println(ans);
		}
	}
}
