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:
USE_STDIO = False

if not USE_STDIO:
    try: import mypc
    except: pass

def Cnk(n, k):
    ans = 1
    for i in range(k):
        ans *= n - i
        ans //= i + 1
    return ans

def main():
    num = [[0] * 4 for _ in range(19)]
    for i in range(19):
        for j in range(4):
            if j: num[i][j] += num[i][j-1]
            if i >= j:
                num[i][j] += 9 ** j * Cnk(i, j)
    
    def count(n):
        if n == 0: return 0
        n = list(map(int, str(n)))
        l = len(n)
        ans = 0
        for i in range(1, l):
            ans += 9 * num[i - 1][2]
        cur = 3
        for i in range(l):
            if n[i] > 0:
                ans += (n[i] - 1) * num[l - i - 1][cur - 1]
                if i: ans += num[l - i - 1][cur]
                cur -= 1
                if cur <= 0: break
        ans += 1
        return ans

    q,  = map(int, input().split(' '))
    for _ in range(q):
        L, R = map(int, input().split(' '))
        ans = count(R) - count(L - 1)
        print(ans)

if __name__ == '__main__':
    main()