Recursive Queries

Description:

Input:

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

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

Output:

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

Sample Input:

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

Sample Output:

1
4
0
8

Sample Input:

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

Sample 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