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

public class Main {

    static FastReader fs = new FastReader();
    
    public static void main(String[] args) {
        int t = fs.nextInt();
        for (int q = 0; q < t; ++q) {
            long n = fs.nextLong(), k = fs.nextLong();
            long ans = 0;
            while (n > 0) {
                if (n % k == 0) {
                    ans++;
                    n /= k;
                }
                else {
                    ans += n % k;
                    n -= (n % k);
                }
            }
            System.out.println(ans);
        }
    }

    static void sort(int arr[]) {
        Arrays.sort(arr);
    }

    static class FastReader {

        BufferedReader br;
        StringTokenizer st;

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

        public String next() {

            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

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

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

        public int[] readarr(int arr[]) {
            for (int i = 0; i < arr.length; ++i) {
                arr[i] = nextInt();
            }
            return arr;
        }

        public long[] readLongarr(long arr[]) {
            for (int i = 0; i < arr.length; ++i) {
                arr[i] = nextLong();
            }
            return arr;
        }

    }

}
