# F(L,R) = f(L) + f(L+1) + ... + f(R) = F(0,R) - F(0,L-1)
# F(0,x)を関数化

# F(0,x)を求めるのに主格転倒的。f(z) = i（i=1~9)をみたすzが0~xの範囲で何個あるかcnt(i,x)
# cnt(i,x) = cnt(j<=i,x) - cnt(j<=i-1,x)

# cnt(j<=i,x)は桁DPで求める


def cnt(i,x):
    if i == 0:
        return 1
    
    dp0 = 1
    dp1 = 0

    S = str(x)
    num = len(S)

    for keta in range(num):
        dp1 = dp0 * min(int(S[keta]),i+1) + dp1 * (i+1)
        if int(S[keta]) > i:
            dp0 = 0

    return dp0 + dp1


def func(x):
    ret = 0
    for i in range(1,10):
        ret += i * (cnt(i,x) - cnt(i-1,x))
    return ret

#print(cnt(1,60))
#exit()

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