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
MAX = 1000000

def f(n):
    if n == 0:
        return 0
    prod = 1
    while n:
        if n%10: prod *= n%10
        n //= 10
        
    return prod

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

class FT:
    def __init__(self):
        self.arr = [0 for _ in range(MAX+1)]

    def ubaci(self, n, x):
        while(n < MAX+1):
            self.arr[n] += x
            n += n&-n

    def upit(self, n):
        ret = 0
        while(n):
            ret += self.arr[n]
            n -= n&-n
        return ret

ft = [FT() for _ in range(10)]
for i in range(1, MAX+1):
    ft[g(i)].ubaci(i, 1)

q = int(input())
for i in range(q):
    l, r, k = map(int, input().split())
    print(ft[k].upit(r) - ft[k].upit(l-1))
