#include <bits/stdc++.h>
using namespace std;
long long a[20][5][2];
int n;
string s;
long long ff(int i, int cnt, int tight) {
  if (i == n && cnt <= 3) return (1);
  if (cnt >= 4) return (0);
  if (a[i][cnt][tight] != -1) return (a[i][cnt][tight]);
  int end;
  if (tight == 0) end = 9;
  if (tight == 1) end = s[i] - '0';
  long long ans = 0;
  for (int j = 0; j <= end; j++) {
    if (!tight) {
      if (j == 0)
        ans = ans + ff(i + 1, cnt, tight);
      else
        ans = ans + ff(i + 1, cnt + 1, tight);
    } else {
      if (j != end) {
        if (j != 0)
          ans = ans + ff(i + 1, cnt + 1, 0);
        else
          ans = ans + ff(i + 1, cnt, 0);
      } else {
        if (j != 0)
          ans = ans + ff(i + 1, cnt + 1, 1);
        else
          ans = ans + ff(i + 1, cnt, 1);
      }
    }
  }
  a[i][cnt][tight] = ans;
  return (ans);
}
int main() {
  long long ans, l, r;
  int t, i;
  cin >> t;
  memset(a, -1, sizeof(a));
  for (i = 0; i < t; i++) {
    memset(a, -1, sizeof(a));
    cin >> l >> r;
    s = to_string(l - 1);
    n = s.size();
    ans = ff(0, 0, 1);
    s = to_string(r);
    n = s.size();
    memset(a, -1, sizeof(a));
    ans = ff(0, 0, 1) - ans;
    cout << ans << endl;
  }
}

### Prompt

Your challenge is to write a Cpp solution 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 a[20][5][2];
int n;
string s;
long long ff(int i, int cnt, int tight) {
  if (i == n && cnt <= 3) return (1);
  if (cnt >= 4) return (0);
  if (a[i][cnt][tight] != -1) return (a[i][cnt][tight]);
  int end;
  if (tight == 0) end = 9;
  if (tight == 1) end = s[i] - '0';
  long long ans = 0;
  for (int j = 0; j <= end; j++) {
    if (!tight) {
      if (j == 0)
        ans = ans + ff(i + 1, cnt, tight);
      else
        ans = ans + ff(i + 1, cnt + 1, tight);
    } else {
      if (j != end) {
        if (j != 0)
          ans = ans + ff(i + 1, cnt + 1, 0);
        else
          ans = ans + ff(i + 1, cnt, 0);
      } else {
        if (j != 0)
          ans = ans + ff(i + 1, cnt + 1, 1);
        else
          ans = ans + ff(i + 1, cnt, 1);
      }
    }
  }
  a[i][cnt][tight] = ans;
  return (ans);
}
int main() {
  long long ans, l, r;
  int t, i;
  cin >> t;
  memset(a, -1, sizeof(a));
  for (i = 0; i < t; i++) {
    memset(a, -1, sizeof(a));
    cin >> l >> r;
    s = to_string(l - 1);
    n = s.size();
    ans = ff(0, 0, 1);
    s = to_string(r);
    n = s.size();
    memset(a, -1, sizeof(a));
    ans = ff(0, 0, 1) - ans;
    cout << ans << endl;
  }
}

```