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;
const int INF = 0x3f3f3f3f;
const long long int LINF = 0x3f3f3f3f3f3f3f3fll;
const long double pi = acos(-1);
const int MOD = 1e9 + 7;
long long int dp[20][2][4];
string second;
int n;
int solve(int i, bool menor, int qnt, bool cu) {
  if (qnt == 4) return 0;
  if (i == n) {
    if (cu)
      return menor;
    else
      return 1;
  }
  if (dp[i][menor][qnt] != -1) return dp[i][menor][qnt];
  int ini = 0, fim = 9;
  if (!menor) fim = second[i] - '0';
  long long int &memo = dp[i][menor][qnt];
  memo = 0;
  for (int k = ini; k <= fim; k++) {
    memo += solve(i + 1, menor | (k < fim), qnt + (k != 0), cu);
  }
  return memo;
}
int main() {
  ios::sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--) {
    cin >> second;
    n = second.size();
    memset(dp, -1, sizeof(dp));
    long long int m = solve(0, false, 0, true);
    cin >> second;
    n = second.size();
    memset(dp, -1, sizeof(dp));
    long long int M = solve(0, false, 0, false);
    cout << M - m << endl;
  }
  return 0;
}