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 PYTHON):

Solution:
def Comb(n, k):
    if k > n: return 0
    ans = 1
    for i in range(k):
        ans = ans * (n-i) / (i+1)
    return ans

def compute(s):
    lucky0 = len([c for c in s if c != '0' and c != '*'])
    stars, ans = s.count('*'), 0
    for q in xrange(4-lucky0):
        ans += Comb(stars, q)*pow(9,q)
    return ans

def solve(n):
    s, ans = str(n), 0
    for i in xrange(len(s)):
        for c in xrange(0,ord(s[i])-ord('0')):
            ans += compute(s[:i]+chr(c+ord('0'))+"*"*len(s[i+1:]))
    ans += compute(s)
    return ans

for i in xrange(int(raw_input())):
    L, R = [int(t) for t in raw_input().split()]
    print solve(R) - solve(L-1)