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:
import sys
lines = sys.stdin.readlines()
T = int(lines[0].strip())
for t in range(1, T+1):
    (l, r) = map(int, lines[t].strip().split(" "))
    def combi(L, count):
        res = 1
        for i in range(count):
            res *= (L-i)
        for i in range(1, count):
            res //= (i+1)
        return res

    def solve(up, count):
        if count == 0: return 1
        st = str(up)
        res = 0
        L = len(st)
        if L <= count:
            return up+1
        if L >= count+1:
            for i in range(count+1):
                res += combi(L-1, i) * (9**i)
        if L >= count:
            for i in range(count):
                res += combi(L-1, i)*(int(st[0])-1) * (9**i)
        res += solve(int(st[1:]), count-1)
        return res
    print(solve(r,3) - solve(l-1,3))