MOD = 7000000001
inv2 = (MOD + 1) // 2


def f(N):  # 1 ~ N - 1
    pow10 = [1] * 20
    for i in range(1, len(pow10)):
        pow10[i] = pow10[i - 1] * 10 % MOD
    ans = 0
    k = 0
    while 10 ** (k + 1) <= N:
        ans += pow10[k] * pow10[k] * 45 % MOD
        k += 1
    rev = 0
    for l in range(k, -1, -1):
        d = N // (10**l) % 10

        lo, hi = 1 if l == k else 0, d

        ans += (hi - lo) * pow10[k + 1] % MOD * (pow10[l] - 1) % MOD * inv2 % MOD
        ans += (hi - lo) * (hi - 1 + lo) * pow10[k] % MOD * inv2 % MOD
        ans += (hi - lo) * rev % MOD * pow10[l] % MOD

        rev = (rev + pow10[k - l] * d) % MOD
    ans %= MOD
    return ans


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