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.
/* package whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Ideone
{
	public static void main (String[] args) throws java.lang.Exception
	{
		 Scanner s = new Scanner (System.in);
      String str="";
      long num=s.nextInt();
      long x=0L;
      long k=0L;
        long counter=0L;
         for (int i = 1; i <=num; i++) {
         x=s.nextLong() ;
         k=s.nextLong();
         
        while(true){
            if(x==0)
            {break;
                
            }
            
            if(x%k==0) {
           x=x/k;
           counter++;
        }
        else{
        	long rem=x%k;
        	x-=rem;
        	counter+=rem;
        	
            
        }
            
            
            
            
        }
     str+=counter+" ";
     counter=0;
         }
        
         System.out.println(str);
	}
}