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 int n;
	static String target;
	static Integer[][][]memo;
	public static int dp(int indx, int tight,int used)
	{
		if(used==4)
		{
			return 0;
		}
		if(indx==target.length())
		{
			return 1;
		}
		if(memo[indx][tight][used]!=null) return memo[indx][tight][used];
		int digit=0;
		int count=0;
		while(digit<10 && (tight==0 || Integer.parseInt(target.charAt(indx)+"")>=digit))
		{
			count+= tight==1 && Integer.parseInt(target.charAt(indx)+"")==digit? dp(indx+1, 1, digit==0?used:used+1) : dp(indx+1, 0, digit==0?used:used+1);
			digit++;
		}
		return memo[indx][tight][used]=count;
	}
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(System.out);
		n = Integer.parseInt(br.readLine());
		for (int i = 0; i < n; i++) {
			StringTokenizer st = new StringTokenizer(br.readLine());
			long t1 = Long.parseLong(st.nextToken()); long t2 = Long.parseLong(st.nextToken()); memo= new Integer[(t2+"").length()][2][4];
			target=t2+"";
			int count1=dp(0, 1, 0);
			target=t1-1+"";
			memo= new Integer[(t2+"").length()][2][4];
			int count2=dp(0, 1,  0);
			pw.println(count1-count2);
		}
		pw.close();
	}
}