#include <bits/stdc++.h>
using namespace std;
long long ncr(int a, int b) {
  if (b > a) return 1;
  long long ret = 1;
  int v = b;
  for (int i = 0; i < v; i++) {
    ret *= a;
    a--;
  }
  for (int i = 0; i < v; i++) {
    ret /= b;
    b--;
  }
  return ret;
}
long long t;
int cnt_smaller(string s) {
  long long ans = 0;
  int l = s.length();
  int z = 0, nz = 0;
  int i = 0;
  for (; i < l; i++) {
    if ((nz) >= 3) {
      break;
    }
    long long small_count = (long long)(s[i] - '0');
    if (s[i] == '0') {
      z++;
    } else {
      nz++;
      int rem = 3 - nz;
      int rempos = l - i - 1;
      rem = min(rem, rempos);
      int tmp = rem;
      while (rem >= 0) {
        ans += (small_count - 1) *
               (ncr(rempos, rem) * (long long)pow(9, min(rem, rempos)));
        rem--;
      }
      rem = min(rempos, tmp + 1);
      while (rem >= 0) {
        ans += (ncr(rempos, rem) * (long long)pow(9, min(rem, rempos)));
        rem--;
      }
    }
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  long long l, r;
  while (t--) {
    cin >> l >> r;
    std::string big = to_string(r);
    std::string small = to_string(l - 1);
    cout << cnt_smaller(big) - cnt_smaller(small) << endl;
  }
}

### Prompt

Please create a solution in Cpp to the following 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long ncr(int a, int b) {
  if (b > a) return 1;
  long long ret = 1;
  int v = b;
  for (int i = 0; i < v; i++) {
    ret *= a;
    a--;
  }
  for (int i = 0; i < v; i++) {
    ret /= b;
    b--;
  }
  return ret;
}
long long t;
int cnt_smaller(string s) {
  long long ans = 0;
  int l = s.length();
  int z = 0, nz = 0;
  int i = 0;
  for (; i < l; i++) {
    if ((nz) >= 3) {
      break;
    }
    long long small_count = (long long)(s[i] - '0');
    if (s[i] == '0') {
      z++;
    } else {
      nz++;
      int rem = 3 - nz;
      int rempos = l - i - 1;
      rem = min(rem, rempos);
      int tmp = rem;
      while (rem >= 0) {
        ans += (small_count - 1) *
               (ncr(rempos, rem) * (long long)pow(9, min(rem, rempos)));
        rem--;
      }
      rem = min(rempos, tmp + 1);
      while (rem >= 0) {
        ans += (ncr(rempos, rem) * (long long)pow(9, min(rem, rempos)));
        rem--;
      }
    }
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  long long l, r;
  while (t--) {
    cin >> l >> r;
    std::string big = to_string(r);
    std::string small = to_string(l - 1);
    cout << cnt_smaller(big) - cnt_smaller(small) << endl;
  }
}

```