#include <bits/stdc++.h>
using namespace std;
int t, n;
long long L, R;
long long v[int(9e5)];
void solve(long long idx, int cnt, long long k) {
  if (idx == 18) {
    v[n++] = k;
    return;
  }
  solve(idx + 1, cnt, k * 10);
  if (cnt < 3) {
    for (int i = 1; i <= 9; i++) {
      solve(idx + 1, cnt + 1, k * 10 + i);
    }
  }
  return;
}
int bs(long long k) {
  int st = 0, en = n - 1;
  while (st < en) {
    int mid = (st + en + 1) >> 1;
    if (v[mid] <= k)
      st = mid;
    else
      en = mid - 1;
  }
  return st + 1;
}
int main() {
  scanf("%d", &t);
  solve(0, 0, 0);
  v[n++] = 1e18;
  sort(v, v + n);
  while (t--) {
    scanf("%I64d %I64d", &L, &R);
    printf("%d\n", bs(R) - bs(L - 1));
  }
  return 0;
}
