#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using i32 = signed int;
using i64 = signed long long;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

#ifdef INT128

using u128 = __uint128_t;
using i128 = __int128_t;

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64)x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64)x;
    return os;
}

#endif

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void)0
#endif

void solve() {
    /*i64 n, k;
    cin >> n >> k;
    --k;
    Vec<i64> pw(19, 1);
    REP(i, 18) {
        pw[i + 1] = pw[i] * 10;
    }
    i32 di = (i32)(upper_bound(ALL(pw), n) - pw.begin());
    const auto cnt = [&](i64 pref) -> i64 {
        if (pref > n) {
            return 0;
        }
        i32 d = (i32)(upper_bound(ALL(pw), pref) - pw.begin());
        i64 ans = 0;
        REP(i, d, di) {
            ans += pw[i - d];
        }
        if (n / pw[di - d] > pref) {
            ans += pw[di - d];
        } else if (n / pw[di - d] == pref) {
            ans += n - pref * pw[di - d] + 1;
        }
        return ans;
    };
    i64 ans = 0;
    while (true) {
        if (ans == 0) {
            REP(i, 1, 10) {
                i64 c = cnt(i);
                if (c > k) {
                    ans = i;
                    break;
                } else {
                    k -= c;
                }
            }
        } else {
            if (k == 0) {
                break;
            }
            --k;
            REP(i, 10) {
                i64 c = cnt(10 * ans + i);
                if (c > k) {
                    ans = 10 * ans + i;
                    break;
                } else {
                    k -= c;
                }
            }
        }
    }
    cout << ans << '\n';*/
    // ずっと K 番目の数を求める問題解いてて勿体なさすぎる...
    string n, k;
    cin >> n >> k;
    Vec<Vec<Vec<i64>>> dp(2, Vec<Vec<i64>>(2, Vec<i64>(n.size() + 1, 0)));
    dp[0][0][0] = 1;
    REP(di, n.size()) {
        i32 d = n[di] - '0';
        Vec<Vec<Vec<i64>>> ndp(2, Vec<Vec<i64>>(2, Vec<i64>(n.size() + 1, 0)));
        REP(i, 2) REP(j, 2) REP(l, 1, n.size()) {
            REP(e, 10) {
                if (!i && e > d) {
                    break;
                }
                if (!j && l >= (i32)k.size()) {
                    break;
                }
                if (!j && e > k[l] - '0') {
                    break;
                }
                ndp[i || e < d][j || e < k[l] - '0'][l + 1] += dp[i][j][l];
            }
        }
        REP(e, 1, 10) {
            if (di == 0 && e > d) {
                break;
            }
            if (e > k[0] - '0') {
                break;
            }
            ndp[di || e < d][e < k[0] - '0'][1] += 1;
        }
        ndp[0][0][0] += dp[0][0][0];
        dp = ndp;
        DBG(dp);
    }
    i64 ans = accumulate(ALL(dp[0][1]), 0LL) + accumulate(ALL(dp[1][1]), 0LL);
    REP(i, 1, k.size()) {
        ans += dp[0][0][i] + dp[1][0][i];
    }
    cout << ans + 1 << '\n';
}

int main() {
    i32 t;
    cin >> t;
    while (t--) {
        solve();
    }
}