#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define ov4(a, b, c, d, name, ...) name
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S>
bool chmin(T &a, const S &b) { return a > b ? a = b, 1 : 0; }
template <typename T, typename S>
bool chmax(T &a, const S &b) { return a < b ? a = b, 1 : 0; }

const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;

#define i128 __int128_t

struct _
{
    _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;



void solve() 
{
    ll l, r;cin >> l >> r;
    l--;

    vl a(10, 0);

    rep(i, 1, 10) {

        map<ll, ll> mp;

        auto saiki = [&](auto self, ll n) -> ll {
            if (n < 0) return 0;
            if (n == 0) return 1;
            if (mp.contains(n)) return mp[n];
            ll ans = 0;
            rep(j, i + 1) {
                if (n - j >= 0) ans += self(self, (n - j) / 10);
            }
            // cerr << "! " << i << " "<< n << " " << mp[n] << endl;
            return mp[n] = ans; 
        };
        a[i] += saiki(saiki, r);
        mp.clear();
        a[i] -= saiki(saiki, l);
    }
    // cerr << l << " " << r << endl;
    // rep(i, 10) cerr << a[i] << " ";
    // cerr << endl;
    per(i, 9, 0) a[i+1] -= a[i];

    ll ans = 0;
    rep(i, 1, 10) ans += a[i] * i;
    cout << ans << endl;

}

int main() {
    int T;cin >> T;
    while (T--) solve();
    return 0;
}