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:
com = [[0]*19 for i in range(19)]


def solve(x):
    sx, non_zero, res = str(x), 3, 0

    for i in range(len(sx)):
        if not int(sx[i]):
            continue

        for j in range(0, non_zero+1):
            res += com[len(sx)-i-1][j] * 9 ** j

        non_zero -= 1

        if non_zero == -1:
            break

        for j in range(0, non_zero+1):
            res += (int(sx[i])-1) * com[len(sx)-i-1][j] * 9 ** j

    return res


def main():
    t = int(input())

    for i in range(19):
        com[i][0] = 1
    for i in range(1, 19):
        for j in range(1, i+1):
            com[i][j] = com[i-1][j] + com[i-1][j-1]

    for i in range(t):
        l, r = map(int, input().split())
        print(solve(r+1)-solve(l))


if __name__ == '__main__':
    main()