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 PYTHON):

Solution:
a = [10 ** 18]

def back(curr, used, sz):
  if used == 3 or sz == -1:
    a.append(curr)
    return

  if not used:
    back(0, 0, sz - 1)
    for x in range(1, 10):
      back(x * 10 ** sz, 1, sz - 1)
  else:
    back(curr, used, sz - 1)
    for x in range(1, 10):
      back(curr + x * 10 ** sz, used + 1, sz - 1)

back(0, 0, 17)

a = sorted(a)

def solve(x):
  st, dr, ans = 0, len(a) - 1, 0
  while st <= dr:
    pivot = (st + dr) / 2
    if a[pivot] <= x:
      ans = pivot + 1
      st = ans
    else:
      dr = pivot - 1
  return ans

for _ in range(int(raw_input())):
  l, r = map(int, raw_input().split())
  print solve(r) - solve(l - 1)