#include <bits/stdc++.h>
using namespace std;
int t;
long long l, r, w;
long long tab[2][2];
int dg(long long a) {
  int ans = 0;
  while (a) {
    if (a % 10) ans++;
    a /= 10;
  }
  return ans;
}
long long f(int k, int n) {
  if (k > 3) return 0;
  if (k == 3) return 1;
  if (k == 2) return (9 * n) + 1;
  if (k == 1) return (81 * n * (n - 1) / 2) + (9 * n) + 1;
}
void nr(long long a, bool b) {
  int j = 0;
  long long d = 10, a2 = a, lim = 1;
  while (a2) {
    a2 /= 10;
    j++;
  }
  tab[b][0] = j;
  if (j == 19) return;
  for (int i = 0; i < j; i++) lim *= 10;
  j = 0;
  while (a > d / 10 && a < lim) {
    if (10 - ((a % d) * 10 / d) == 10)
      tab[b][1] += f(dg(a), j) + 9 * f(dg(a) + 1, j);
    else
      tab[b][1] += (10 - ((a % d) * 10 / d)) * f(dg(a), j);
    a += (10 - ((a % d) * 10 / d)) * d / 10;
    d *= 10;
    j++;
  }
  if (a < 10) tab[b][1] = 10 - a;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> t;
  for (int i = 0; i < t; i++) {
    cin >> l >> r;
    w = 0;
    tab[0][1] = 0;
    tab[1][1] = 0;
    nr(l, 0);
    nr(r, 1);
    for (int j = tab[0][0] + 1; j <= min(tab[1][0], 18ll); j++) {
      w += 9 * f(1, j - 1);
    }
    cout << w - tab[1][1] + tab[0][1] + (dg(r) < 4) << "\n";
  }
  return 0;
}
