#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

const int MAX_LOG = 18;

void solve() {
    string N, K;
    cin >> N >> K;

    ll ans = 0;
    for (int len = 1; len <= int(N.size()); len++) {
        vector dp(2, vector<ll>(2, 0)), ndp(2, vector<ll>(2, 0));
        dp[len == int(N.size())][1] = 1;
        for (int k = 0; k < len; k++) {
            for (int i = 0; i < 2; i++) {
                for (int j = 0; j < 2; j++) {
                    ll& val = dp[i][j];
                    if (val == 0) continue;
                    for (int d = 0; d < 10; d++) {
                        if (k == 0 and d == 0) continue;
                        int ni = i, nj = j;
                        if (i == 1 and (N[k] - '0') < d) continue;
                        if (i == 1 and d < (N[k] - '0')) ni = 0;
                        if (j == 1 and (k >= int(K.size()) or (K[k] - '0') < d)) continue;
                        if (j == 1 and d < (K[k] - '0')) nj = 0;
                        ndp[ni][nj] += val;
                    }
                    val = 0;
                }
            }
            swap(dp, ndp);
        }
        ans += dp[0][0] + dp[1][0];
        if (len <= int(K.size())) ans += dp[0][1] + dp[1][1];
    }

    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    for (; T--;) solve();
    return 0;
}