#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

void solve() {
  constexpr int D = 10;
  string n, k; cin >> n >> k;
  const int l = n.length();
  k += string(l - k.length(), '/');
  vector dp(l, vector(2, vector(2, 0LL)));
  REP(i, l) {
    vector nxt(l, vector(2, vector(2, 0LL)));
    REP(x, l - 1) REP(y, 2) {
      REP(d, D) {
        const char c = '0' + d;
        if (y || c <= n[i]) {
          nxt[x + 1][y || c < n[i]][true] += dp[x][y][true];
          if (c <= k[x + 1]) nxt[x + 1][y || c < n[i]][c < k[x + 1]] += dp[x][y][false];
        }
      }
    }
    // スタート
    FOR(d, 1, D) {
      const char c = '0' + d;
      if ((i > 0 || c <= n[i]) && c <= k[0]) {
        nxt[0][i > 0 || c < n[i]][c < k[0]] += 1;
      }
    }
    dp.swap(nxt);
  }
  ll ans = 0;
  REP(x, l) REP(y, 2) REP(z, 2) ans += dp[x][y][z];
  cout << ans << '\n';
}

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