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.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.util.stream.IntStream;

public class Main {

    final static long MOD = 1000000007;
    public static void main(String[] args) {
        FastScanner fs = new FastScanner();
        PrintWriter out = new PrintWriter(System.out);
        int n = fs.nextInt();
        int mat[][] = new int[n][3];
        for(int i = 0; i < n; i++) {
            mat[i] = fs.nextIntArray(3);
        }

        int prefixMat[][] = new int[(int)1e6+1][10];
        Arrays.fill(prefixMat[0], 0);
        for(int i = 1; i < (int)1e6+1; i++) {
                for(int j = 0; j < 10; j++) {
                    if(j == g(i)) {
                        prefixMat[i][j] += prefixMat[i-1][j] + 1;
                    } else {
                        prefixMat[i][j] = prefixMat[i-1][j];
                    }
                }
        }

//        for(int i = 0; i < 100; i++) {
//            for(int j = 0; j < 10; j++) {
//                System.out.print(prefixMat[i][j]+" ");
//            }
//            System.out.println();
//        }

        for(int i = 0; i < n; i++) {
            int l = mat[i][0];
            int r = mat[i][1];
            int k = mat[i][2];
            //System.out.println(prefixMat[r][k]+" "+prefixMat[l][k]);
            out.println(prefixMat[r][k]-prefixMat[l-1][k]);
        }
        out.flush();
        out.close();
    }

    public static int g(int x) {
       int gl = 1;
       if(x < 10)
           return x;
       while(x > 0) {
           int digit = x % 10;
           x = x/10;
           if(digit > 0) {
               gl *= digit;
           }
           if(x <= 0) {
               if(gl < 10)
                   break;
               x = gl;
               gl = 1;
           }
       }
       return gl;
    }

    static class Node {
        int x;
        int y;
        int depth;

        Node(){

        }

        Node(int x, int y ){
            this.x = x;
            this.y = y;
        }
    }

    public static int count(String text, String find) {
        int index = 0, count = 0, length = find.length();
        while( (index = text.indexOf(find, index)) != -1 ) {
            index += length; count++;
        }
        return count;
    }

    public static double round(double value, int places) {
        if (places < 0) throw new IllegalArgumentException();

        BigDecimal bd = new BigDecimal(value);
        bd = bd.setScale(places, RoundingMode.HALF_UP);
        return bd.doubleValue();
    }


    public static long sumDigits(long i) {
        return i == 0 ? 0 : i % 10 + sumDigits(i / 10);
    }

    public static long fact(long n){
        long rest = 1;
        while(n > 1){
            rest *= n;
            n--;
        }
        return rest;
    }

    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner() {
            try {
                br = new BufferedReader(new InputStreamReader(System.in));
                //br = new BufferedReader(new FileReader("prodan.json"));
                st = new StringTokenizer("");
            } catch (Exception e) {
                e.printStackTrace();
            }
        }

        public String next() {
            if (st.hasMoreTokens())
                return st.nextToken();
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception 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 line = "";
            try {
                line = br.readLine();
            } catch (Exception e) {
                e.printStackTrace();
            }
            return line;
        }

        public Integer[] nextIntegerArray(int n) {
            Integer[] a = new Integer[n];
            for (int i = 0; i < n; i++)
                a[i] = nextInt();
            return a;
        }

        public int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = nextInt();
            return a;
        }

        public long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++)
                a[i] = nextLong();
            return a;
        }

        public char[] nextCharArray() {
            return nextLine().toCharArray();
        }
    }
}