Problem: Let us define two functions f and g on positive integer numbers. 

<image>

<image>

You need to process Q queries. In each query, you will be given three integers l, r and k. You need to print the number of integers x between l and r inclusive, such that g(x) = k. 

Input

The first line of the input contains an integer Q (1 ≤ Q ≤ 2 × 105) representing the number of queries. 

Q lines follow, each of which contains 3 integers l, r and k (1 ≤ l ≤ r ≤ 106, 1 ≤ k ≤ 9).

Output

For each query, print a single line containing the answer for that query.

Examples

Input

4
22 73 9
45 64 6
47 55 7
2 62 4


Output

1
4
0
8


Input

4
82 94 6
56 67 4
28 59 9
39 74 4


Output

3
1
1
5

Note

In the first example:

  * g(33) = 9 as g(33) = g(3 × 3) = g(9) = 9
  * g(47) = g(48) = g(60) = g(61) = 6
  * There are no such integers between 47 and 55. 
  * g(4) = g(14) = g(22) = g(27) = g(39) = g(40) = g(41) = g(58) = 4

Solution (in JAVA):

Solution:
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

public class q5 {
	static long aa,bb;
	static long score1,score2,steps;
	static ArrayList<NoD>[] arr;
	static Stack<Integer> finalans,tempans;
	//static HashSet<Integer> vis;
	static int[] ans;
	static long[] dist;
	
	long gcd(long a,long b) {
		if(b==0) return a;
		else return gcd(b,a%b);
	}
	
	
	static int prod(String s, int ii) {
		int a=s.length();
		int ans=1;
		for(int i=0;i<s.length();i++) {
			int r=s.charAt(i)-48;
			if(r!=0) ans*=r;
		}
		if(ans<=9) {
			q5.ans[ii]=ans;
		}
		else {
			ans=prod(Integer.toString(ans),ans);
			q5.ans[ii]=ans;
		}
		return ans;
		
	}
	
	
	public static void main(String[] args) throws IOException {
		
		Reader.init(System.in);
		StringBuffer output=new StringBuffer("");
		PrintWriter out=new PrintWriter(System.out);
		int n=Reader.nextInt();
		int[][] dp=new int[1000001][10];
		 ans=new int[1000001];
		
		for(int i=1;i<=1000000;i++) {
			if(ans[i]==0)
				{int nn=q5.prod(Integer.toString(i),i);}
			
			
			
		}
		for(int ii=1;ii<=1000000;ii++) {
			for(int i=1;i<=9;i++) {
				if(ans[ii]==i) {
					dp[ii][i]=1+dp[ii-1][i];
				}
				else {
					dp[ii][i]=dp[ii-1][i];
				}
			}
		}
		for(int i=0;i<n;i++) {
			int l=Reader.nextInt();
			int r=Reader.nextInt();
			int k=Reader.nextInt();
			output.append(dp[r][k]-dp[l-1][k]);
			output.append("\n");
		}
		
		out.write(output.toString());
		out.flush();
		
	}
}

class NoD{
	int a;long b,c;
	NoD(int aa,long bb){
		a=aa;b=bb;
	}
	
}

class Dis {
	int[] arr;
	int[] parent;
	int[] rank;
	int[] size;
	Dis(int n){
		arr=new int[n+1];
		parent=new int[n+1];
		rank=new int[n+1];
		size=new int[n+1];
		for(int i=1;i<=n;i++) {
			arr[i]=i;
			parent[i]=i;
			rank[i]=0;
			size[i]=1;
		}
	}

	int find(int value) {
		int par=parent[value];
		if(par==value)
			return par;
		parent[value]=find(par);
		return parent[value];
	}
	
	void union(int data1,int data2) {
		int parent1=find(data1);
		int parent2=find(data2);
		if(parent1!=parent2) {
			if(rank[parent1]>=rank[parent2]) {
				parent[parent2]=parent1;
				if(rank[parent1]==rank[parent2])
					rank[parent1]++;
				size[parent1]+=size[parent2];
			}
			else {
				parent[parent1]=parent2;
				size[parent2]+=size[parent1];
			}
		}
		
	}


}
class Reader {
    static BufferedReader reader;
    static StringTokenizer tokenizer;
 
    /** call this method to initialize reader for InputStream */
    static void init(InputStream input) {
        reader = new BufferedReader(
                     new InputStreamReader(input) );
        tokenizer = new StringTokenizer("");
    }
 
    /** get next word */
    static String nextLine() throws IOException{
    	return reader.readLine();
    }
    static String next() throws IOException {
        while ( ! tokenizer.hasMoreTokens() ) {
            //TODO add check for eof if necessary
            tokenizer = new StringTokenizer(
                   reader.readLine() );
        }
        return tokenizer.nextToken();
    }
    
    static int nextInt() throws IOException {
        return Integer.parseInt( next() );
    }
    static long nextLong() throws IOException {
        return Long.parseLong( next() );
    }
    static double nextDouble() throws IOException {
        return Double.parseDouble( next() );
    }
}