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
from bisect import bisect_left 
  
def BinarySearch(a, x): 
    i = bisect_left(a, x) 
    if i != len(a) and a[i] == x: 
        return i 
    else: 
        return -1
import bisect
p = 9
d = {}
for i in range(1,p+1):
    d[i] = []
c = {}
for i in range(1,1000001):
    p = str(i)
    s = 1
    for j in range(len(p)):
        if p[j]!='0':
            s*=int(p[j])
    while len(str(s))!=1:
        l = 1
        s = str(s)
        for j in range(len(s)):
            if s[j]!='0':
                l*=int(s[j])
        s = l
    d[s].append(i)
n = int(input())
for _ in range(n):
    l,r,k = map(int,input().split())
    z = 0
    p = bisect.bisect_right(d[k],l)
    q = bisect.bisect_left(d[k],r)
    if BinarySearch(d[k],l)!=-1:
        z+=1
    if BinarySearch(d[k],r)!=-1:
        z+=1
    z+=q-p-1
    print(z+1)