# 桁dp...めんどい～～
# dp[i][x][f] = (上からi桁決めて、未満フラグがfで、現在の最大値がxな個数)

def calc(n: int):
    s = list(map(int, str(n)))
    l = len(s)
    dp = [[[0] * 2 for _ in range(10)] for _ in range(l + 1)]
    dp[0][0][0] = 1
    for i in range(l):
        for j in range(10):
            for x in range(10):
                dp[i + 1][max(j, x)][1] += dp[i][j][1]
                if x <= s[i]:
                    dp[i + 1][max(j, x)][x < s[i]] += dp[i][j][0]
    return sum(sum(dp[l][i]) * i for i in range(10))


def solve():
    l, r = map(int, input().split())
    print(calc(r) - calc(l - 1))


T = int(input())
for _ in range(T):
    solve()