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

Solution:
import sys
class Solution():
    mem = dict()

    def classy_Numbers(self):
        T = int(sys.stdin.readline().strip())
        self.queries = []
        for t in range(T):
            left, right = list(map(int, sys.stdin.readline().strip().split()))
            print(self.dp(right, 3) - self.dp(left-1, 3))

    def dp(self, target, limit):
        num_digits = len(str(target))
        if (target, limit) in self.mem:
            return self.mem[(target, limit)]
        if limit == 0:
            return 1
        if num_digits <= limit:
            return target + 1

        top_digit = target // (10 ** (num_digits-1))
        res = target % (10 ** (num_digits-1))
        ret = self.dp(res, limit-1) \
                + max(top_digit-1, 0) * self.dp(10**(num_digits-1)-1, limit-1) \
                + self.dp(10**(num_digits-1)-1, limit)
        self.mem[(target, limit)] = ret
        return ret

sol = Solution()
sol.classy_Numbers()
# print(sol.dp(1, 3))
# print(sol.dp(1234, 4, 3))
# print(sol.dp(12345, 5, 3))