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 PYTHON3):

Solution:
from sys import stdin

C = [[0] * 20 for _ in range(20)]
for i in range(20):
    C[i][0] = C[i][i] = 1
    for j in range(1, i):
        C[i][j] = C[i - 1][j] + C[i - 1][j - 1]

pw = [1, 9, 81, 729]


def get(n, lft):
    return sum(C[n][i] * pw[i] for i in range(lft + 1) if 0 <= i <= n)


def calc(x):
    s = str(x)
    res = 0
    cur = 3
    n = len(s)

    for i in range(n):
        if s[i] == '0':
            continue

        res += get(n - i - 1, cur)
        cur -= 1
        if cur == -1:
            break

        res += get(n - i - 1, cur) * (int(s[i]) - 1)

    return res


stdin.readline()
test = stdin.readlines()
output = []
for line in test:
    L, R = map(int, line.split())
    ans = calc(R + 1) - calc(L)
    output.append(ans)

print('\n'.join(map(str, output)))