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>
namespace ztd {
using namespace std;
template <typename T>
inline T read(T& t) {
  t = 0;
  short f = 1;
  char ch = getchar();
  double d = 0.1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -f;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') t = t * 10 + ch - '0', ch = getchar();
  if (ch == '.') {
    ch = getchar();
    while (ch <= '9' && ch >= '0') t += d * (ch ^ 48), d *= 0.1, ch = getchar();
  }
  t *= f;
  return t;
}
}  // namespace ztd
using namespace ztd;
long long dp[20][5];
long long l, r;
long long a[20];
long long dfs(int x, int num, bool flag) {
  if (!x) return 1;
  if (!flag && dp[x][num] != -1) return dp[x][num];
  int uplim = flag ? a[x] : 9;
  long long ret = 0;
  for (int i = 0; i <= uplim; ++i) {
    if (i == 0)
      ret += dfs(x - 1, num, (flag && i == a[x]));
    else if (num < 3)
      ret += dfs(x - 1, num + 1, (flag && i == a[x]));
  }
  if (!flag) dp[x][num] = ret;
  return ret;
}
long long work(long long x) {
  long long t = 0;
  while (x) {
    a[++t] = x % 10;
    x /= 10;
  }
  return dfs(t, 0, 1);
}
inline void Main() {
  memset(dp, -1, sizeof(dp));
  read(l);
  read(r);
  cout << work(r) - work(l - 1) << '\n';
}
signed main() {
  int T;
  read(T);
  while (T--) Main();
  return 0;
}