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.*;
import java.util.*;

public class Main {
    static char[] num;
    static long[][][] memo;
    public static long dp(int idx, int cnt, int tight){
        if(idx == num.length){
            if(cnt < 4) return 1;
            else return 0;
        }

        if(memo[idx][cnt][tight] != -1) return memo[idx][cnt][tight];

        int limit = 9;
        if(tight == 1) limit = Integer.parseInt(num[idx]+"");
        long ans = 0;
        for(int i = 0; i <= 9; i++){
            if(tight == 1) {
                if (i < limit)
                    ans += dp(idx + 1, cnt + (i == 0 ? 0 : 1), 0);
                else if (i == limit)
                    ans += dp(idx + 1, cnt + (i == 0 ? 0 : 1), 1);
            }
            else ans += dp(idx + 1, cnt + (i == 0 ? 0 : 1), 0);
        }

        return memo[idx][cnt][tight] = ans;
    }

    public static void main(String[] args) throws IOException {
        int tc = sc.nextInt();
        while(tc-- > 0) {
            long l = sc.nextLong(); long r = sc.nextLong();
            num = (l-1+"").toCharArray();
            memo = new long[20][20][2];
            for (long[][] x : memo)
                for (long[] y : x)
                    Arrays.fill(y, -1);
            long ansL = dp(0, 0, 1);
            num = (r+"").toCharArray();
            memo = new long[20][20][2];
            for (long[][] x : memo)
                for (long[] y : x)
                    Arrays.fill(y, -1);
            long ansR = dp(0,0,1);
            pw.println(ansR-ansL);

        }
        pw.close();
    }

    public static void pairSort(Pair[] arr) {
        ArrayList<Pair> l = new ArrayList<>();
        for (Pair i : arr) l.add(i);
        Collections.sort(l, Collections.reverseOrder());
        for (int i = 0; i < arr.length; i++) {
            arr[i] = l.get(i);
        }
    }
    public static void longSort(long[] arr) {
        ArrayList<Long> l = new ArrayList<>();
        for (long i : arr) l.add(i);
        Collections.sort(l);
        for (int i = 0; i < arr.length; i++) {
            arr[i] = l.get(i);
        }
    }
    public static void intSort(int[] arr) {
        ArrayList<Integer> l = new ArrayList<>();
        for (int i : arr) l.add(i);
        Collections.sort(l);
        for (int i = 0; i < arr.length; i++) {
            arr[i] = l.get(i);
        }
    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        public int nextInt() throws IOException {
            return Integer.parseInt(next());
        }

        public long nextLong() throws IOException {
            return Long.parseLong(next());
        }

        public String nextLine() throws IOException {
            return br.readLine();
        }

        public double nextDouble() throws IOException {
            String x = next();
            StringBuilder sb = new StringBuilder("0");
            double res = 0, f = 1;
            boolean dec = false, neg = false;
            int start = 0;
            if (x.charAt(0) == '-') {
                neg = true;
                start++;
            }
            for (int i = start; i < x.length(); i++)
                if (x.charAt(i) == '.') {
                    res = Long.parseLong(sb.toString());
                    sb = new StringBuilder("0");
                    dec = true;
                } else {
                    sb.append(x.charAt(i));
                    if (dec)
                        f *= 10;
                }
            res += Long.parseLong(sb.toString()) / f;
            return res * (neg ? -1 : 1);
        }

        public boolean ready() throws IOException {
            return br.ready();
        }

        public int[] nextIntArr(int n) throws IOException {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = Integer.parseInt(next());
            }
            return arr;
        }

        public long[] nextLongArr(int n) throws IOException {
            long[] arr = new long[n];
            for (int i = 0; i < n; i++) {
                arr[i] = Long.parseLong(next());
            }
            return arr;
        }

    }
    static class Pair implements Comparable<Pair>{
        int first; int second;
        public Pair(int first, int second){
            this.first = first; this.second = second;
        }

        @Override
        public int compareTo(Pair p2) {
            if(second == p2.second) return first - p2.first;
            else return second - p2.second;
        }

        @Override
        public String toString() { return "("+ first + "," + second + ')'; }

    }
    static class Triple implements Comparable<Triple> {
        double x, y, z, sum;

        Triple(double a, double b, double c) { x = a; y = b; z = c; sum = x + y + z; }


        public int compareTo(Triple t)
        {
            if(Math.abs(sum - t.sum) < 1e-9) return x > t.x ? 1 : -1;
            return sum > t.sum ? 1 : -1;
        }
        public String toString()
        {
            return x + " " + y  + " " + z;
        }
    }

    static PrintWriter pw = new PrintWriter(System.out);
    static Scanner sc = new Scanner(System.in);
    static final int MOD = (int) 1e9 + 7;
    static Random random = new Random();
}