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

MAX_N = 20
MAX_DIG = 3
dp = [[0] * (MAX_DIG + 1) for i in range(MAX_N)]

def calc_dp():
    dp[0][0] = 1
    for i in range(1, MAX_N):
        dp[i][0] = 1
        for j in range(MAX_DIG):
            dp[i][j + 1] += 9 * dp[i - 1][j]
            dp[i][j + 1] += dp[i - 1][j + 1]

def first_dig(n):
    cnt = 0
    while n >= 10:
        n //= 10
        cnt += 1
    return n, cnt

def calc_ans(n):
    ans = 0
    for n_digs in range(MAX_DIG, -1, -1):
        x, cnt = first_dig(n)
        for i in range(n_digs):
            ans += x * dp[cnt][i]
        ans += dp[cnt][n_digs]
        n -= x * 10 ** cnt
    return ans

def main():
    calc_dp()
    T = int(input())
    for _ in range(T):
        l, r = map(int, input().split())
        print(calc_ans(r) - calc_ans(l - 1))

if __name__ == '__main__':
    main()