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

Solution:
import java.io.BufferedInputStream;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(new BufferedInputStream(System.in));
        long n = scan.nextInt();
        Task tsk = new Task();
        for (int i=0;i<n;i++)
            System.out.println(tsk.solve(scan.nextLong(), scan.nextLong()));
    }

    static class Task{
        public long solve(long l, long r) {
            return (cnt(r) - cnt(l-1));
        }

        private long cnt(long val) {
            char[] str = Long.toString(val).toCharArray();
            Long[][][] memo = new Long[str.length][4][2];
            return dfs(str, 0, 3, false, memo);
        }

        private long dfs(char[] str, int idx, int remain, boolean smaller, Long[][][] memo) {
            if (remain == 0) return 1;
            if (idx == str.length) return 1;
            if (memo[idx][remain][smaller?1:0] != null) return memo[idx][remain][smaller?1:0];
            long cnt = 0;
            for (int i=0;i<=(smaller?9:str[idx]-'0');i++) {
                cnt += dfs(str, idx+1, remain - (i>0?1:0), smaller || i < str[idx] - '0', memo);
            }
            memo[idx][remain][smaller?1:0] = cnt;
            return cnt;
        }
    }
}