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

#k=int(input())
#n,m=map(int,input().split())

#a=list(map(int,input().split()))

#b=list(map(int,input().split()))


q=int(input())
r=[0]*3*10**5
k=[0]*3*10**5
l=[0]*3*10**5


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


f=[0]*2*10**6
g=[0]*2*10**6

for i in range(1,10):
    f[i]=i; g[i]=i;


for i in range(10,10**6+1):
    if i%10!=0:
        f[i]=f[i//10]*(i%10)
    else:
        f[i]=f[i//10]

for i in range(10,10**6+1):
    g[i]=g[f[i]]

cnt=[0]*2*10**6
for i in range(10**6+1):
    cnt[i]=[0]*11

for i in range(1,10**6+1):
    for j in range(1,11):
        cnt[i][j]=cnt[i-1][j]

    cnt[i][g[i]]=1+cnt[i-1][g[i]]
 


for i in range(q):
    print(cnt[r[i]][k[i]]-cnt[l[i]-1][k[i]])





