Problem: Let's call some positive integer classy if its decimal representation contains no more than 3 non-zero digits. For example, numbers 4, 200000, 10203 are classy and numbers 4231, 102306, 7277420000 are not.

You are given a segment [L; R]. Count the number of classy integers x such that L ≤ x ≤ R.

Each testcase contains several segments, for each of them you are required to solve the problem separately.

Input

The first line contains a single integer T (1 ≤ T ≤ 10^4) — the number of segments in a testcase.

Each of the next T lines contains two integers L_i and R_i (1 ≤ L_i ≤ R_i ≤ 10^{18}).

Output

Print T lines — the i-th line should contain the number of classy integers on a segment [L_i; R_i].

Example

Input

4
1 1000
1024 1024
65536 65536
999999 1000001


Output

1000
1
0
2

Solution (in PYTHON):

Solution:
def count (x):
    n = len(x)
    d = [0, 0, 0]
    c = 0
    for i in range(n):
        y = int(x[i])
        if i == 0: d[0] = y
        else:
            e = [0, 0, 0]
            e[0] = 9 + d[0]
            e[1] = d[1] + 9 * d[0]
            e[2] = d[2] + 9 * d[1]
            if c < 3: e[c] -= 9 - y
            d = e
        if y != 0: c += 1
    return sum(d)

t = input()
while t > 0:
    t -= 1

    l, r = raw_input().split()
    print count(r) - count(str(int(l) - 1))