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.util.Scanner;
     
    public class ClassyNumbers {
    	public static void main(String[] args) {
    		Scanner scan=new Scanner(System.in);
    		int t=scan.nextInt();
    		for(int tt=0;tt<t;tt++) {
    			String a=(scan.nextLong()-1)+"";
    			String b=(scan.nextLong())+"";
    			
    			init(b.length());
    			long x=go(0,0,0,b);
    			
    			init(a.length());
    			long y=go(0,0,0,a);
    			
    			System.out.println(x-y);
    		}
    	}
    	public static long go(int ind, int nonZero, int less, String max) {
    		if(ind==max.length()) return 1;
    		
    		if(dp[ind][nonZero][less]!=null) return dp[ind][nonZero][less];
    		
    		long res=0;
    		
    		int end=less==1?9:max.charAt(ind)-'0';
    		
    		for(int i=0;i<=end;i++) {
    			int nextNonZero=i==0?nonZero:nonZero+1;
    			if(nextNonZero>3) continue;
    			
    			int nextLess=0;//0=not less
    			if(less==1) nextLess=1;//1=less
    			else if(i<end) nextLess=1;
    			
    			res+=go(ind+1,nextNonZero,nextLess,max);
    		}
    		return dp[ind][nonZero][less]=res;
    	}
    	public static void init(int len) {
    		dp=new Long[len][4][2];
    		
    	}
    	static Long[][][] dp;
    }