#include <bits/stdc++.h>
#define sz(x) ((int)(x).size())
#define all(x) begin(x), end(x)
#ifdef memset0
#define log(...) fprintf(stderr, __VA_ARGS__)
#else
#define endl '\n'
#define log(...) (void(0))
#endif
using namespace std;
using ll = long long;
using lf = long double;
using ull = unsigned long long;
const int M = 12;
const int AD = 20;
const int N = 1e6;
int T;
ll ss[2][15][(AD << 1) + 10];
ll ql, qr;
int tl, tr;
ll sum[N + 10];
int a[15], sz;
ll ans;
ll Calc(ll r, int fl) {
  // log("CALC %lld %d\n", r, fl);
  if (!r) return 0;
  sz = 0;
  while (r) a[sz++] = r % 10, r /= 10;
  ll ret = 0;
  for (int i = sz - 1; i >= 0; --i) {
    if (a[i] > 0) {
      if (i == sz - 1) {
        ret += ss[0][i][AD + 1 - fl];
      } else {
        ret += ss[1][i][AD + 1 - (fl + 1)];
      }
      ret += (a[i] - 1 >> 1) * ss[1][i][AD + 1 - (fl + 1)];
      ret += (a[i] >> 1) * ss[1][i][AD + 1 - (fl - 1)];
    }
    fl += ((a[i] & 1) ? -1 : 1);
  }
  // log("RET=%lld\n", ret + (fl > 0));
  return ret + (fl > 0);
}
int Count(ll x) {
  int ret = 0;
  while (x) {
    ret += ((x & 1) ? -1 : 1);
    x /= 10;
  }
  return ret;
}
ll Que(ll l, ll r, int fl) {
  // log("QUE in %lld %lld=%lld-%lld\n", l, r, Calc(r, fl), Calc(l - 1, fl));
  return Calc(r, fl) - Calc(l - 1, fl);
}
int Getsq(ll x) {
  int ret = (int)sqrt((lf)x);
  while (1ll * (ret + 1) * (ret + 1) <= ql) ++ret;
  return ret;
}
void Check(ll l, ll r, ll ans) {
  ll res = 0;
  for (ll i = l; i <= r; ++i) {
    res += (Count(i) + Count(Getsq(i)) > 0);
  }
  log("ANSWER=%lld\n", res);
  assert(res == ans);
}
int main() {
#ifdef memset0
  freopen("E.in", "r", stdin);
#endif
  // cin.tie(0)->sync_with_stdio(0);
  for (int i = 0; i <= AD; ++i) ss[1][0][i] = 1;
  for (int i = 1; i <= M; ++i) {
    // log("i=%d,M=%d\n", i, M);
    ss[1][i][0] = ss[1][i - 1][0] * 10;
    ss[0][i][0] = ss[0][i - 1][0] + ss[1][i - 1][0] * 9;
    for (int j = 1; j <= i + AD; ++j) {
      ss[1][i][j] = 5 * ss[1][i - 1][j - 1] + 5 * ss[1][i - 1][j + 1];
      ss[0][i][j] = ss[0][i - 1][j] + 4 * ss[1][i - 1][j - 1] + 5 * ss[1][i - 1][j + 1];
      // log("SS0 %d %d=%lld,SS1 %d %d=%lld\n", i, j - AD, ss[0][i][j], i, j - AD, ss[1][i][j]);
    }
  }
  for (int i = 1; i <= N; ++i) {
    sum[i] = sum[i - 1] + Que(1ll * i * i, 1ll * (i + 1) * (i + 1) - 1, Count(i));
  }
  cin >> T;
  while (T--) {
    cin >> ql >> qr;
    tl = Getsq(ql), tr = Getsq(qr);
    if (tl < tr) {
      ans = sum[tr - 1] - sum[tl];
      ans += Que(ql, 1ll * (tl + 1) * (tl + 1) - 1, Count(tl)) + Que(1ll * tr * tr, qr, Count(tr));
    } else {
      ans = Que(ql, qr, Count(tl));
    }
    cout << ans << "\n";
#ifdef memset0
    Check(ql, qr, ans);
#endif
  }
}