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 CF1036C {
	static long[][] cnt;
	static void init() {
		long[][] chs = new long[20][4];
		chs[0][0] = 1;
		for (int n = 1; n < 20; n++) {
			chs[n][0] = 1;
			for (int k = 1; k <= 3 && k <= n; k++)
				chs[n][k] = chs[n - 1][k] + chs[n - 1][k - 1];
		}
		int[] p9 = { 1, 9, 81, 729 };
		cnt = new long[20][4];
		for (int k = 0; k <= 3; k++)
			cnt[0][k] = 1;
		for (int n = 1; n < 20; n++) {
			cnt[n][0] = 1;
			for (int k = 1; k <= 3; k++)
				cnt[n][k] = chs[n][k] * p9[k] + cnt[n][k - 1];
		}
	}
	static long solve(long n, int k) {
		if (n == 0 || k == 0)
			return 1;
		long d = n;
		while (d >= 10)
			d /= 10;
		long p = 1;
		int z = 0;
		while (d * p <= n / 10) {
			p *= 10;
			z++;
		}
		return solve(n - d * p, k - 1) + (d - 1) * cnt[z][k - 1] + cnt[z][k];
	}
	public static void main(String[] args) throws IOException {
		init();
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(System.out);
		int t = Integer.parseInt(br.readLine());
		while (t-- > 0) {
			StringTokenizer st = new StringTokenizer(br.readLine());
			long l = Long.parseLong(st.nextToken());
			long r = Long.parseLong(st.nextToken());
			pw.println(solve(r, 3) - solve(l - 1, 3));
		}
		pw.close();
	}
}