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

<img align="middle" class="tex-formula" src="https://espresso.codeforces.com/120df92771639f1f51a4b216dccd3ed7c32bb859.png" style="max-width: 100.0%;max-height: 100.0%;"/> 

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*.
The first line of the input contains an integer *Q* (1 ≤ *Q* ≤ 2 × 10<sup class="upper-index">5</sup>) representing the number of queries. 

*Q* lines follow, each of which contains 3 integers *l*, *r* and *k* (1 ≤ *l* ≤ *r* ≤ 10<sup class="upper-index">6</sup>, 1 ≤ *k* ≤ 9).
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
4
22 73 9
45 64 6
47 55 7
2 62 4
1
4
0
8
4
82 94 6
56 67 4
28 59 9
39 74 4
3
1
1
5
# import sys
# from io import StringIO
#
# sys.stdin = StringIO(open(__file__.replace('.py', '.in')).read())

n = int(input())

mem = {}

top = 10 ** 6
ori = [0] * (top + 1)
arr = [[0 for x in range(top + 1)] for y in range(10)]

def cp(n):
    p = 1
    while n > 0:
        r = n % 10
        p = p * (r if r > 0 else 1)
        n = n // 10
    return p

def f(n):
    if n < 10:
        return n

    global mem

    if n in mem:
        return mem[n]

    r = f(cp(n))
    mem[n] = r
    return mem[n]


for i in range(1, top + 1):
    ori[i] = f(i)

for i in range(1, 10):
    for j in range(1, top + 1):
        if ori[j] == i:
            arr[i][j] = arr[i][j-1] + 1
        else:
            arr[i][j] = arr[i][j-1]

for _ in range(n):
    l, r, k = list(map(int, input().split()))
    print(arr[k][r] - arr[k][l-1])
