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

public class CFR66A {
  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
//     InputStream inputStream = new FileInputStream("in.txt");
//     OutputStream outputStream = new FileOutputStream("out.txt");

    InputReader in = new InputReader(inputStream);
    PrintWriter out = new PrintWriter(outputStream);

//    Code here!
    int T = in.nextInt();
    for (int tt = 0; tt < T; tt++) {
      long n = in.nextLong();
      long k = in.nextLong();
      long ctr = 0;
      while (true) {
        if (n == 0) {
          out.println(ctr);
          break;
        }

        if (n % k == 0) {
          n /= k;
          ctr++;
        } else {
          long tmp = (n / k) * k;
          ctr += n - tmp;
          n = tmp;
        }
      }
    }

    out.close();
  }

  static class InputReader{BufferedReader reader;StringTokenizer tokenizer;InputReader(InputStream stream){reader=new BufferedReader(new InputStreamReader(stream),32768);tokenizer=null;}String next(){while(tokenizer==null||!tokenizer.hasMoreTokens()){try{tokenizer=new StringTokenizer(reader.readLine());}catch(IOException e){throw new RuntimeException(e);}}return tokenizer.nextToken();}String nextLine(){try{return reader.readLine();}catch(IOException e){e.printStackTrace();}return"";}int nextInt(){return Integer.parseInt(next());}long nextLong(){return Long.parseLong(next());}}
}
