#include <bits/stdc++.h>
using namespace std;
string s;
long long dp[20][5][2];
long long solve(long long pos, long long ct, bool tight) {
  if (pos == s.length()) {
    return 1;
  }
  if (dp[pos][ct][tight] != -1) {
    return dp[pos][ct][tight];
  }
  int end = tight ? (s[pos] - '0') : 9;
  int res = 0;
  for (int i = 0; i <= end; i++) {
    int ctupd = ct + (i > 0);
    if (ctupd <= 3) {
      res += solve(pos + 1, ctupd, (tight && (i == end)));
    }
  }
  return dp[pos][ct][tight] = res;
}
int main() {
  long long t;
  cin >> t;
  while (t--) {
    long long l, r;
    cin >> l >> r;
    memset(dp, -1, sizeof(dp));
    s = to_string(r);
    long long ans = solve(0, 0, 1);
    memset(dp, -1, sizeof(dp));
    if (l != 0) {
      s = to_string(l - 1);
      ans -= solve(0, 0, 1);
    }
    cout << ans << endl;
  }
}
