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
#!/usr/bin/python3
from math import log10
import sys

c = {}

def numAt(n, c, i): return n / 10**(c-i-1)%10
def numLen(n): return int(log10(n)) + 1 if n else 0
def f(n):
    s = 1
    for i in range(numLen(n)):
        r = int(numAt(n, numLen(n), i))
        if r != 0: s *= r
    return s

def g(n):
    while n > 9:
        n = f(n)
    return(n)
qr = int(sys.stdin.readline())
q = []
for i in range(qr):
    q.append([int(x) for x in sys.stdin.readline().split(" ")])

for i in q:
    new = 0
    for y in range(i[0], i[1]+1):
        if g(y) == i[2]:
            new += 1
    print(new)
sys.exit()
