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 arr[(long long)1e7 + 4], N;
long long Q, L, R;
void push(long long val, long long T) {
  if (val) arr[++N] = val;
  if (val == 999) {
    int g = 1;
  }
  if (val < (long long)1e17) {
    if (T) {
      for (long long i = 1; i < 10; ++i) push(val * 10 + i, T - 1);
    }
    if (val) push(val * 10, T);
  }
}
int main() {
  ;
  push(0, 3);
  arr[++N] = (long long)1e18;
  sort(arr + 1, arr + N + 1);
  scanf("%lld", &Q);
  while (Q--) {
    scanf("%lld %lld", &L, &R);
    printf("%lld\n", (long long)(upper_bound(arr + 1, arr + N + 1, R) -
                                 lower_bound(arr + 1, arr + N + 1, L)));
  }
  return 0;
}