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


def calc(n: int):
    dp = [[0] * 2 for _ in range(10)]
    dp[0][0] = 1
    for s in map(int, str(n)):
        ndp = [[0] * 2 for _ in range(10)]
        for j in range(10):
            for x in range(10):
                ndp[max(j, x)][1] += dp[j][1]
                if x <= s:
                    ndp[max(j, x)][x < s] += dp[j][0]
        dp = ndp
    return sum(sum(dp[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()