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:
def C(n, r):
    ret = 1
    for i in range(r):
        ret = ret * (n - i) // (i + 1);
    return ret

def f(N):
    N = [int(ch) for ch in reversed(str(N))]
    cnt, nonzero = 0, 0
    for k in range(len(N)-1, -1, -1):
        if N[k] > 0:
            for i in range(4 - nonzero):
                cnt += C(k, i) * pow(9, i)
            nonzero += 1
            for i in range(4 - nonzero):
                cnt += (N[k] - 1) * C(k, i) * pow(9, i)
        if nonzero > 3:
            break
    return cnt

for run in range(int(input())):
    l, r = map(int, input().split())
    print(f(r+1) - f(l))