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 math
def combi(L,n):
    return math.factorial(L)//math.factorial(n)//math.factorial(L-n)


T=int(input())
LR=[list(map(int,input().split())) for i in range(T)]

def classy(less,nonzero,now):
    L=len(str(now))

    if less==0:
        if 3-nonzero>=L:
            return 10**L
        else:
            ANS=1
            for i in range(1,3-nonzero+1):
                ANS+=combi(L,i)*(9**i)

            return ANS

    else:
        if nonzero<=2:
            if now<=9:
                return now+1
            
            else:
                if int(str(now)[0])==1:
                    return classy(1,nonzero+1,int(str(now)[1:]))\
                           +classy(0,nonzero,int("9"*(L-1)))\

                else:
                    return classy(1,nonzero+1,int(str(now)[1:]))\
                           +(int(str(now)[0])-1)*classy(0,nonzero+1,int("9"*(L-1)))\
                           +classy(0,nonzero,int("9"*(L-1)))

        else:
            return 1

for l,r in LR:
    print(classy(1,0,r)-classy(1,0,l-1))