#include <bits/stdc++.h>
using namespace std;
int digit[20];
bool is[20];
long long mods(int bit, long long mai_mic, long long egal) {
  if (bit < 0) return mai_mic + egal;
  if (!is[bit]) {
    if (!digit[bit]) return mods(bit - 1, mai_mic, egal);
    return mods(bit - 1, mai_mic + egal, 0);
  }
  if (digit[bit] >= 2)
    return mods(bit - 1, mai_mic * 9 + egal * (digit[bit] - 1), egal);
  else if (digit[bit] == 0)
    return mods(bit - 1, mai_mic * 9, 0);
  return mods(bit - 1, mai_mic * 9, egal);
}
long long mod(long long x) {
  int bmax = 0;
  for (int i = 0; x; i++, bmax++) digit[i] = x % 10, x /= 10;
  long long ans = 0;
  for (int i = 0; i < bmax; i++) {
    for (int j = i; j < bmax; j++) {
      for (int k = j; k < bmax; k++) {
        if (i == j && k != j) continue;
        is[i] = is[j] = is[k] = 1;
        ans += mods(bmax - 1, 0, 1);
        is[i] = is[j] = is[k] = 0;
      }
    }
  }
  return ans;
}
int main() {
  int n;
  long long a, b, k;
  cin >> n;
  while (n--) {
    cin >> a >> b;
    cout << mod(b) - mod(a - 1) << '\n';
  }
  return 0;
}
