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
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

t = int(input())

def calc(x):
    s = str(x)
    n = len(s)
    dp = [[[0]*2 for i in range(5)] for j in range(n+1)]
    dp[0][0][0] = 1
    for i in range(n):
        for j in range(5):
            for k in range(2):
                nd = int(s[i])
                for d in range(10):
                    ni = i+1
                    nj = j
                    nk = k
                    if d != 0:
                        nj = min(nj+1, 4)
                    if k == 0:
                        if d > nd:
                            continue
                        elif d < nd:
                            nk = 1
                        else:
                            pass
                    dp[ni][nj][nk] += dp[i][j][k]
    res = 0
    for j in range(4):
        for k in range(2):
            res += dp[n][j][k]
    return res

for _ in range(t):
    l, r = map(int, input().split())
    print(calc(r)-calc(l-1))