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.io.PrintWriter;
import java.io.IOException ;
import java.io.BufferedReader ;
import java.io.InputStreamReader ;
import java.io.BufferedOutputStream;
import java.util.StringTokenizer ;
import java.util.Scanner;


public class CF1175A{

	public static PrintWriter out;

	public static void main(String args[]) throws IOException{
		new CF1175A().run();
	}

	void run(){
		out = new PrintWriter(new BufferedOutputStream(System.out));
		try{
			solve();
		}catch(Exception e){
			e.printStackTrace();
		}
		out.flush();
	}

	void solve() throws IOException{
		//FastScanner sc = new FastScanner();
		Scanner sc = new Scanner(System.in);
		int t;
		long n, k, ans=0, po=0;

		t = sc.nextInt();

		while(t-- >0){
			n = sc.nextLong();
			k = sc.nextLong();
			ans=0;
			po=0;

			while(n >= k){
				ans += n%k;
				++po;
				n = n/k;
			}
			ans += n;
			ans += po;
			System.out.println(ans);
		}
	}

	class FastScanner{
		BufferedReader br;
		StringTokenizer strTok;
		String str;

		public FastScanner(){
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next(){
			while(strTok==null || !strTok.hasMoreTokens()){
				try{
					strTok = new StringTokenizer(br.readLine());
				}catch(IOException e){
					e.printStackTrace();
				}
			}
			return strTok.nextToken();
		}

		String nextLine(){
			try{
				str = br.readLine();
			}catch(IOException e){
				e.printStackTrace();
			}
			return str;
		}

		int nextInt(){
			return Integer.parseInt(next());
		}

		long nextLong(){
			return Long.parseLong(next());
		}

		double nextDouble(){
			return Double.parseDouble(next());
		}
	}
}