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:
factorial=[1]
for x in range(1,20):
    factorial.append(factorial[-1]*x)
def choose(n,x):
    global factorial
    return factorial[n]//(factorial[x]*factorial[n-x])
def func(a):
    string=str(a)
    tot=0
    count=0
    for x in range(len(string)):
        d=int(string[x])
        if d!=0:
            count+=1
            for y in range(3-count+1+1):
                tot+=choose(len(string)-1-x,y)*9**y
            for y in range(3-count+1):
                tot+=(d-1)*(choose(len(string)-1-x,y))*9**y
    return (tot)
def main():
    count=int(input())
    for _ in range(count):
        arr=input().split()
        print(func(int(arr[1])+1)-func(int(arr[0])))
main()