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.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

/**
 * Created by vlad on 08.11.15.
 */
public class problemC {

    public void precalc(List<Long> numbers, int pos, int k, long number) {
        if (pos == 19) {
            numbers.add(number);
            return;
        }

        precalc(numbers, pos + 1, k, number * 10);

        if (k == 0) {
            return;
        }
        for (int i = 1; i < 10; i++) {
            precalc(numbers, pos + 1, k - 1, number * 10 + i);
        }
    }

    public long lower_bound(List<Long> numbers, long q) {
        int l = -1;
        int r = numbers.size();
        int m;
        while (r - l > 1) {
            m = (l + r) / 2;
            if (numbers.get(m) <= q) {
                l = m;
            } else {
                r = m;
            }
        }

        return l;
    }

    public long upper_bound(List<Long> numbers, long q) {
        int l = -1;
        int r = numbers.size();
        int m;
        while (r - l > 1) {
            m = (l + r) / 2;
            if (numbers.get(m) >= q) {
                r = m;
            } else {
                l = m;
            }
        }

        return r;
    }

    public void solve(Scanner in, PrintWriter out) {
        List<Long> numbers = new ArrayList<>();
        precalc(numbers, 0, 3, 0);

        int t = in.nextInt();
        for (int test = 0; test < t; test++) {
            long l = in.nextLong();
            long r = in.nextLong();

            out.println(lower_bound(numbers, r) - upper_bound(numbers, l) + 1L);
        }

    }

    public static void main(String args[]) {
        Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

        new problemC().solve(in, out);

        in.close();
        out.close();
    }

}