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.lang.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.*;

public class Main {
        
        
    public static void main(String[] args) throws Exception{
        // TODO Auto-generated method stub
        //Reader.init(System.in);
       // Scanner sc=new Scanner(System.in);
        FastReader sc=new FastReader(); 
        OutputStream outputStream = System.out;
        PrintWriter out = new PrintWriter(outputStream);
        ArrayList<Integer> list=new ArrayList<Integer>();
        int t=sc.nextInt();
        while(t>0) {
        long n=sc.nextLong();
        long k=sc.nextLong();
        long ans=0;
        while(n>0) {
            if(n%k==0) {
                n/=k;
                ans++;
            }
            else {
                ans+=(n%k);
                n-=(n%k);
            }
        }
        System.out.println(ans);
        t--;
        }
        }
}  

class pair{
    int f;int s;
    pair(int f,int s){
        this.f=f;
        this.s=s;
    }
}
class node{
    ArrayList<Integer> list;
    int freq;
    node(){
        list=new ArrayList<Integer>();
    }
}
class a implements Comparator<pair>{
    public int compare(pair p1,pair p2) {
        return (int)(p1.f-p2.f);
    }
}
class FastReader 
{ 
    BufferedReader br; 
    StringTokenizer st; 

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

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

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

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

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

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