Problem: Let's call some positive integer classy if its decimal representation contains no more than 3 non-zero digits. For example, numbers 4, 200000, 10203 are classy and numbers 4231, 102306, 7277420000 are not.

You are given a segment [L; R]. Count the number of classy integers x such that L ≤ x ≤ R.

Each testcase contains several segments, for each of them you are required to solve the problem separately.

Input

The first line contains a single integer T (1 ≤ T ≤ 10^4) — the number of segments in a testcase.

Each of the next T lines contains two integers L_i and R_i (1 ≤ L_i ≤ R_i ≤ 10^{18}).

Output

Print T lines — the i-th line should contain the number of classy integers on a segment [L_i; R_i].

Example

Input

4
1 1000
1024 1024
65536 65536
999999 1000001


Output

1000
1
0
2

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
string a, b;
long long dp[5][20][3][3];
long long F(int cnt, int pos, bool lead, bool zero) {
  if (cnt > 3) {
    return 0;
  }
  if (pos >= (int)b.size()) {
    return lead;
  }
  long long& ret = dp[cnt][pos][lead][zero];
  if (ret != -1) {
    return ret;
  }
  ret = 0;
  for (int i = 0; i <= 9; i++) {
    if (zero == false && i > (b[pos] - '0')) break;
    if (i) {
      ret += F(cnt + 1, pos + 1, 1, zero == true ? zero : ((b[pos] - '0') > i));
    } else {
      ret += F(cnt, pos + 1, lead, zero == true ? zero : ((b[pos] - '0') > i));
    }
  }
  return ret;
}
void solve() {
  cin >> a >> b;
  for (int i = (int)a.size() - 1; i >= 0; i--) {
    if (a[i] == '0') {
      a[i] = '9';
      continue;
    }
    a[i]--;
    break;
  }
  memset(dp, -1, sizeof dp);
  long long ans = F(0, 0, 0, 0);
  swap(a, b);
  memset(dp, -1, sizeof dp);
  cout << ans - F(0, 0, 0, 0) << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int tc;
  cin >> tc;
  while (tc--) {
    solve();
  }
  return 0;
}