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;
long long t[300005] = {1}, l, r, tst, a, b;
vector<long long> kek;
int main() {
  for (long long i = 0; i < 19; i++)
    if (i != 0) t[i] = t[i - 1] * 10;
  for (long long i = 0; i < 19; i++)
    for (long long j = 0; j < 10; j++)
      if (j) kek.push_back(j * t[i]);
  for (long long i = 0; i < 19; i++) {
    for (long long j = 1; j < 10; j++) {
      for (long long k = i + 1; k < 19; k++) {
        for (long long l = 1; l < 10; l++) {
          kek.push_back(j * t[i] + l * t[k]);
        }
      }
    }
  }
  for (long long a = 0; a < 19; a++)
    for (long long b = 1; b < 10; b++)
      for (long long c = a + 1; c < 19; c++)
        for (long long d = 1; d < 10; d++)
          for (long long e = c + 1; e < 19; e++)
            for (long long f = 1; f < 10; f++)
              kek.push_back(b * t[a] + d * t[c] + f * t[e]);
  sort(kek.begin(), kek.end()),
      kek.resize(distance(kek.begin(), unique(kek.begin(), kek.end())));
  cin >> tst;
  while (tst--) {
    cin >> a >> b;
    cout << (lower_bound(kek.begin(), kek.end(), b + 1) - kek.begin()) -
                (lower_bound(kek.begin(), kek.end(), a) - kek.begin())
         << "\n";
  }
}