You are given two numbers $L$ and $R$. You have to find the count of powerful numbers that are present in the range $[L, R]$.
Note: A powerful number is a valid number that contains at least three distinct digits.

Input format

• First line: $T$ denoting the number of test cases

For each test case:

• First line: Two space-separated integers $L$  and $R$

Output format

• For each test case, print the answer in a separate line.

Constraints
$1 \le T \le 100$
$0 \le L \le R \le 10^9$