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:
from sys import stdin, stdout

pw = [1, 9, 81, 729]
C = [[0 for _ in range(20)] for _ in range(20)]

def Cn_k(n: int, k: int):
    if k < 0 or k > n:
        return 0
    return C[n][k]

def get(n: int, lft: int):
    total = 0
    for i in range(lft + 1):
        total += Cn_k(n, i) * pw[i]
    return total

def calc(x: int):
    sx = str(x)

    ans = 0
    cur = 3
    n = len(sx)

    for i in range(n):
        if sx[i] == '0':
            continue
        ans += get(n - i - 1, cur)
        cur -= 1
        if cur == -1:
            break
        ans += get(n - i - 1, cur) * (int(sx[i]) - 1)
    return ans


if __name__ == "__main__":
    for i in range(20):
        C[i][0] = C[i][i] = 1
        for j in range(1, i):
            C[i][j] = C[i - 1][j] + C[i - 1][j - 1]

    to_int = lambda x : int(x)

    T = list(map(to_int,stdin.readline().split()))[0]
    intervals = [list(map(to_int,stdin.readline().split())) for i in range(T)]

    res = [calc(intervals[i][1] + 1) - calc(intervals[i][0]) for i in range(T)]
    
    for i in range(T):
        stdout.write("{}\n".format(res[i]))