Polo, the Penguin, likes numbers. He says that the goodness of a number is itself multiplied by the number of digits in it's decimal representation. For example, the goodness of the integer 474 is 474*3 = 1422.
Help him to count the sum of goodness of all integers from L to R, inclusive. Since the answer can be too large, output it modulo 1,000,000,007 (10^9+7).

Input
The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. The only line of each test case contains the pair of integers L and R, separated by a single space.

Output
For each test case, output a single line containing the answer to the corresponding test case.

Constraints

1 ≤ T ≤ 1,000
1 ≤ L ≤ R ≤ 1,000,000,000 (10^9)


Example
Input:
1
9 12

Output:
75


Explanation
Example case 1. The answer is 9*1 + 10*2 + 11*2 + 12*2 = 75.
def summation(a,b):
    n=b-a+1
    return ((a+b)*n)/2

t= int(raw_input())
c=0
while c < t :
    l=(raw_input())

    li=l.split(" ")

    x=int(li[0])
    y=int(li[1])

    mi = len(str(x))
    mx = len(str(y))

    s=int(0)
    #start = clock()

    i=mi
    ini= x

    while i<mx:
             s+=summation(ini,(10**i)-1)*i
             ini = 10**i
             i+=1


    s+=summation(ini,y)*i

    print s%1000000007

    c+=1
    #print clock() - start