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;
vector<long long> a;
void func(long long x, int c) {
  if (x > 1e18 or c > 3) return;
  a.push_back(x);
  for (int i = 0; i < 10; ++i)
    if (x * 10 + i > 0) func(x * 10 + i, c + !!i);
}
int main() {
  func(0, 0);
  sort(begin(a), end(a));
  int T;
  cin >> T;
  while (T--) {
    long long L, R;
    cin >> L >> R;
    cout << upper_bound(begin(a), end(a), R) - lower_bound(begin(a), end(a), L)
         << endl;
  }
}