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 as bs


def f(x):
    pr = 1
    while x > 0:
        re = x % 10
        if re > 0:
            pr *= re
        x //= 10
    return pr


def g(x, memo):
    if x in memo:
        return memo[x]
    else:
        if x < 10:
            memo[x] = x
            return memo[x]
        else:
            memo[x] = g(f(x), memo)
            return memo[x]


if __name__ == '__main__':
    lis = []
    memo = {}
    ans = {key: [] for key in range(1, 10)}
    for i in range(1, 123):
        lis.append(g(i, memo))
    for i in range(len(lis)):
        ans[lis[i]].append(i + 1)
    for _ in range(int(input().strip())):
        l, r, k = [int(i) for i in input().strip().split()]
        ar = ans[k]
        if len(ar) == 0:
            print(0)
        else:
            st = bs(ar, l)
            en = bs(ar, r)
            an = en - st + 1
            if ar[en] != r:
                an -= 1
            if an < 0:
                an = 0
            print(an)
