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 main {

   
    public static void main(String[] args) {
        long x=0,y=0,i=0;
        Scanner in=new Scanner(System.in);
        int t=in.nextInt();
        for(int j=1;j<=t;j++)
        {
       long n=in.nextLong();
       long k=in.nextLong();
       if(n<k)
       {
          System.out.println(n); 
       }
       else{
        while(n!=0)
        {
            x=(n%k);
           // System.out.println(x);
            n=n-x;
            y=y+x;
            if(n<k)
            {
               y=(y+n+i);
               System.out.println(y);
               //System.exit(0);
               y=0;
               x=0;
               i=0;
               break;
            }
            //System.out.println(n);
            
           
            n=n/k;
            i++;
            x=0;
          // System.out.println(n);
           
            
            
            
         /*   if(n%k==0)
            {
                n=n/k;
                i++;
            }
            else if(n%k!=0)
            {
                x=n%k;
                y=y+x;
                x=0;
                n=n/k;
                i++;
                
              System.out.println(y+i);  
            }*/
           
            
        }
      // System.out.println(y+i);
    }
        }
        
    }
    
}
