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:
def ncr(n, r):
    return int(fact(n) / (fact(r)
                       * fact(n - r)))


# Returns factorial of n
def fact(n):
    res = 1

    for i in range(2, n + 1):
        res = res * i

    return res


def f(s):
    j=0
    ans=0
    cnt=0
    n=len(s)
    while(j<n):



        if int(s[j])!=0:
            for k in range(3 - cnt + 1):
                if k <= (n - j - 1):
                    ans += (ncr(n - j - 1, k)) * (9 ** k)
            for k in range(3-cnt):
                if k <= (n - j - 1):
                    ans+=(int(s[j])-1)*((ncr(n-j-1,k))*(9**k))

            cnt+=1

        if cnt==3:
            break




        j+=1

    return ans

t=int(input())
for i in range(t):
    l,r=map(int,input().split())
    print(f(str(r))-f(str(l-1)))