#include <bits/stdc++.h>
using namespace std;
const int N = 500 + 10;
int num[20];
int dp[20][4];
int dfs(int cur, int rest, bool flag) {
  if (cur == -1) {
    return 1;
  }
  if (!rest) return 1;
  if (!flag && ~dp[cur][rest]) return dp[cur][rest];
  int res = 0;
  int up = flag ? num[cur] : 9;
  for (int i = 0; i <= up; i++) {
    res += dfs(cur - 1, rest - bool(i), flag && i == up);
  }
  return flag ? res : dp[cur][rest] = res;
}
int solve(long long n) {
  int cnt = 0;
  while (n) {
    num[cnt++] = n % 10;
    n /= 10;
  }
  return dfs(cnt - 1, 3, true);
}
int main() {
  int t;
  cin >> t;
  long long l, r;
  memset(dp, -1, sizeof(dp));
  while (t--) {
    cin >> l >> r;
    cout << solve(r) - solve(l - 1) << endl;
  }
  return 0;
}
