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 \le x \le 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 \le T \le 10^4$) — the number of segments in a testcase.

Each of the next $T$ lines contains two integers $L_i$ and $R_i$ ($1 \le L_i \le R_i \le 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

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "from itertools import combinations\n\nall_classy = []\n\ndef all_possible(a):\n    if len(a) == 0:\n        return [['0']*19]\n    lower = all_possible(a[1:])\n    ans = []\n    for l in lower:\n        for x in range(1, 10):\n            this = l[:]\n            this[a[0]] = str(x)\n            ans.append(this)\n    return ans\n\nfor i in range(1, 4):\n    for a in combinations(range(19), i):\n        this_possible = all_possible(a)\n        this_possible = [int(''.join(x)) for x in this_possible]\n        all_classy += this_possible\n\nall_classy.sort()\n\ndef ge(num):\n    if num == 1:\n        return 0\n    lower, upper = 0, len(all_classy)\n    while lower < upper - 1:\n        mid = (lower+upper)>>1\n        if(all_classy[mid] < num):\n            lower = mid\n        else:\n            upper = mid\n\n    return upper\n\n\ndef le(num):\n    lower, upper = 0, len(all_classy)\n    while lower < upper-1:\n        mid = (lower+upper)>>1\n        if all_classy[mid] > num:\n            upper = mid\n        else:\n            lower = mid\n\n    return lower\n\nq = int(input())\n\nfor i in range(q):\n    l, r = map(int, input().strip().split())\n    x, y = ge(l), le(r)\n    print(y-x+1)"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 34880590