def f(n):
    dp = [0]*(20*10*2)

    def csv(i,j,k):
        return i*10*2 + j*2 + k

    dp[csv(19,0,0)]=1
    for i in range(19, 0, -1):
        d = n//(10**(i-1))%10
        left = 0
        left2 = 0
        tmp = 0
        for k in range(10):
            dp[csv(i-1,k,1)]+=dp[csv(i,k,1)]*(k+1)+left
            left += dp[csv(i,k,1)]
            dp[csv(i-1,k,1)]+=dp[csv(i,k,0)]*tmp
            if k<d:
                # 元より入れたやつのが大きい
                left2 += dp[csv(i,k,0)]
                dp[csv(i-1,k,1)]+=left2
                tmp += 1
        for j in range(10):
            dp[csv(i-1,max(j,d),0)]+=dp[csv(i,j,0)]
    res = 0
    for i in range(10):
        for k in range(2):
            res += i*dp[csv(0,i,k)]
    return res

T=int(input())
for _ in range(T):
    L,R=map(int,input().split())
    print(f(R) - f(L-1))