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 s;
long long dp[20][4][2];
long long solve(long long pos, long long count, bool tight) {
  if (pos == s.size()) {
    return 1;
  }
  if (dp[pos][count][tight] != -1) {
    return dp[pos][count][tight];
  }
  long long end;
  if (tight) {
    end = s[pos] - '0';
  } else {
    end = 9;
  }
  long long ans = 0;
  for (long long i = 0; i <= end; i++) {
    long long new_count = count + (i > 0);
    if (new_count <= 3) {
      ans += solve(pos + 1, new_count, tight && (i == end));
    }
  }
  return dp[pos][count][tight] = ans;
}
int main() {
  long long n, i, j, k, t, r, l;
  cin >> t;
  while (t--) {
    cin >> l >> r;
    memset(dp, -1, sizeof dp);
    s = to_string(r);
    long long ans1 = solve(0, 0, 1);
    s = to_string(l - 1);
    memset(dp, -1, sizeof dp);
    long long ans2 = solve(0, 0, 1);
    cout << ans1 - ans2 << endl;
  }
}