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 = 'import math\n\ndef check(x):\n    cnt = 0\n    while(x):\n        cnt = cnt + (x%10 != 0)\n        x = math.floor(x/10)\n    return cnt<=3\n\ndef bl(x):\n    ans = 0\n    for i in range(1,x+1):\n        if check(i):\n            ans = ans+1\n    return ans\n\n\ndef jc(x):\n    sm = 1\n    for i in range(1,x+1):\n        sm = sm * i\n    return sm\n\ndef c(x,y):\n    if x<y:\n        return 0\n    return jc(x)/(jc(x-y)*jc(y))\n\ndef cal1(x,y):\n    ans = 0\n    for i in range(1,min(x,y)+1):\n        ans = ans + c(x,i)*(9**i)\n    return ans+1\n\ndef revers(x):\n    ans = 0\n    while(x):\n        ans = ans*10+ x%10\n        x = x.__floordiv__(10)\n\n    return ans\n\ndef cal2(x):\n    rx = revers(x)\n    ans = 0\n    cnt = 0\n    l = 0\n    l_ = 0\n    while(x):\n        l = l+1\n        x = x.__floordiv__(10)\n\n\n    while(rx):\n        now = rx % 10\n        rx = rx.__floordiv__(10)\n        l_ = l_ + 1\n        if now!=0:\n            cnt = cnt+1\n        else:\n            continue\n        ans = ans + (now-1)*cal1(l-l_,3-cnt) + cal1(l-l_,3-cnt+1)\n\n        if cnt>=3:\n            break\n\n    return ans\n\nT = int(input())\nfor i in range(T):\n\n    x,y = list(map(int,input().split()))\n\n    print(int(cal2(y)-cal2(x-1)))\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14123