#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while(tt--) {
    string n, k;
    cin >> n >> k;
    ll dp[3][3]{};
    dp[1][1] = 1;
    ll ans = 0;
    rep(i, n.size()) {
      ll ndp[3][3]{};
      int ni = n[i] - '0', ki = k[i] - '0';
      for(int x = (i == 0); x < 10; x++) {
        rep(a, 3) rep(b, 3) {
          int na = a, nb = b;
          if (na == 1) {
            if (x < ni) na = 0;
            else if (x > ni) na = 2;
          }
          if (nb == 1) {
            if (x < ki) nb = 0;
            else if (x > ki) nb = 2;
          }
          ndp[na][nb] += dp[a][b];
        }
      }
      swap(dp, ndp);
      int amx = 3 - (i + 1 == n.size());
      int bmx = 2 - (i >= k.size());
      rep(a, amx) rep(b, bmx) ans += dp[a][b];
    }
    cout << ans << '\n';
  }
}