#include <bits/stdc++.h>

using namespace std;
using LL = long long;
const int N = 20, M = N * 10;
LL dp[N][M][M], f[N][M];
int a[N], len, dbg;

LL solve(int p, int sum, int lim) {
  if (sum < 0) return 0;
  if (!p) return !sum;
  if (!lim && ~f[p][sum]) return f[p][sum];
  int up = lim ? a[p] : 9;
  LL ans = 0;
  for (int i = 0; i <= up; i++) {
    ans += solve(p - 1, sum - i, lim && i == up);
  }
  if (!lim) f[p][sum] = ans;
  return ans;
}

LL solve(int p, int sum, int pre, int lead, int lim) {
  // if (dbg) clog << p << ' ' << sum << ' ' << pre << ' ' << lead << ' ' << lim << ' ' << ' ' << dp[p][sum][pre];
  if (p < 2) return 0;
  // if (pre > sum) return 0;
  if (!lead && !lim && ~dp[p][sum][pre]) return dp[p][sum][pre];
  int up = lim ? a[p] : 9;
  LL ans = 0;
  for (int i = 0; i <= up; i++) {
    int nlead = lead && !i, nlim = lim && i == up;
    if (pre + i > sum / 2 || (p == 2 && !nlead)) {
      int coef = min(abs(2 * pre - sum), abs(2 * (pre + i) - sum));
      ans += 1ll * coef * solve(p - 1, sum - pre - i, nlim);
    }
    else {
      ans += solve(p - 1, sum, pre + i, nlead, nlim);
    }
  }
  if (!lead && !lim) dp[p][sum][pre] = ans;
  return ans;
}

LL calc(LL n) {
  len = 0;
  while (n) a[++len] = n % 10, n /= 10;
  int s = len * 9;
  // clog << s << endl;
  LL ans = 0;
  for (int i = 1; i <= s; i++) {
    dbg = i == 27 && s == 36;
    ans += solve(len, i, 0, 1, 1);
  }
  return ans;
}

void solve() {
  LL l, r;
  cin >> l >> r;
  // clog << calc(r) << ' ' << calc(l - 1) << endl;
  cout << calc(r) - calc(l - 1) << '\n';
}

int main() {
  // freopen("1.in", "r", stdin);
  cin.tie(0)->sync_with_stdio(0);
  int T;
  cin >> T;
  memset(dp, -1, sizeof dp);
  memset(f, -1, sizeof f);
  while (T--) solve();
  return 0;
}