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:
#Bhargey Mehta (Junior)
#DA-IICT, Gandhinagar
import sys, math, queue, bisect
#sys.stdin = open("input.txt", "r")
MOD = 10**9+7
sys.setrecursionlimit(1000000)

def solve(x, i, sml, nonz):
    if nonz > 3:
        return 0
    if i == len(x):
        if nonz > 3: return 0
        return 1
    global dp
    #print(i, sml, nonz)
    if dp[i][sml][nonz] != -1:
        return dp[i][sml][nonz]

    ans = 0
    for di in range(x[i]+1):
        if di == 0:
            ans += solve(x, i+1, di<x[i] or sml, nonz)
        else:
            ans += solve(x, i+1, di<x[i] or sml, nonz+1)
    if sml:
        for di in range(x[i]+1, 10):
            ans += solve(x, i+1, sml, nonz+1)

    dp[i][sml][nonz] = ans
    return ans

for _ in range(int(input())):
    x, y = map(int, input().split())
    x -= 1
    x = list(map(int, list(str(x))))
    y = list(map(int, list(str(y))))

    dp = [[[-1 for i in range(4)] for i in range(2)] for i in range(len(y))]
    y = solve(y, 0, False, 0)
    dp = [[[-1 for i in range(4)] for i in range(2)] for i in range(len(x))]
    x = solve(x, 0, False, 0)

    print(y-x)