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 {
    private static Reader in;
    private static PrintWriter out;
    static class Reader {
        private BufferedReader br;
        private StringTokenizer token;
        protected Reader(FileReader obj) {
            br = new BufferedReader(obj, 32768);
            token = null;
        }
        protected Reader() {
            br = new BufferedReader(new InputStreamReader(System.in), 32768);
            token = null;
        }
        protected String next() {
            while(token == null || !token.hasMoreTokens()) {
                try {
                    token = new StringTokenizer(br.readLine());
                } catch (Exception e) {e.printStackTrace();}
            } return token.nextToken();
        }

        protected int nextInt() {return Integer.parseInt(next());}
        protected long nextLong() {return Long.parseLong(next());}
        protected double nextDouble() {return Double.parseDouble(next());}
    }
    static long[][][] dp;
    static ArrayList<Integer> digit;
    private static void setDigit(long n) {
        digit = new ArrayList<>();
        while (n>0) {
            digit.add((int)(n%10));
            n /= 10;
        }
    }
    private static long getClassyUTIL (int ind, int nzero, int limit) {
        if (nzero == 3 || ind == -1) return 1;
        if (dp[ind][nzero][limit] != -1 && limit == 0) return dp[ind][nzero][limit];
        int k = (limit == 1)?digit.get(ind):9;
        long ans = 0;
        for (int i=0; i<=k; i++) {
            int new_limit = (digit.get(ind) == i) ? limit : 0;
            ans += getClassyUTIL(ind-1, (i != 0) ? nzero+1 : nzero, new_limit);

        }
        if (limit == 0) dp[ind][nzero][limit] = ans;
        return ans;
    }
    private static long getClassy (long num) {
         setDigit(num);
         return getClassyUTIL(digit.size()-1, 0, 1);
    }
    public static void main(String[] args) throws IOException {
        in = new Reader();
        out = new PrintWriter(System.out);
        dp = new long[19][4][2];
        for (int i=0; i<18; i++) {
            for (int j=0; j<4; j++) {
                for (int k=0; k<2; k++) dp[i][j][k] = -1;
            }
        }
        int t = in.nextInt();
        while (t-->0) {
            long l = in.nextLong(), r = in.nextLong();
            out.printf("%d\n", getClassy(r) - getClassy(l-1));
        }
        out.close();
    }
}