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(x,i):
    if i==0:
        return 1
    if i==1:
        return x
    if i==2:
        return x*(x-1)//2
def func(n):
    #print(n)
    ans=min(999,int(n))
   #print(ans)
    dl=len(n)
    if dl<=3:
        return ans
    for x in range(4,dl):
        for i in range(3):
            ans+= (9*comb(x-1,i)*(9**(i)))
    cn=0
    for j in range(dl):
        if int(n[j])!=0:
            cn+=1
            for i in range(3-cn+1):
                ans+=((int(n[j])-1)*comb(dl-j-1,i)*(9**(i)))
            if j!=0:
                 for i in range(3-cn+2):
                        ans+=(comb(dl-j-1,i)*(9**(i)))
        if cn==3:
            break
    return ans+1
t=int(input())
for _ in range(t):
    l,r=raw_input().split()
    #print(len(l),len(r))
    print(func(str(int(r)))-func(str(int(l)-1)))
    #print("*****")
    #print()