import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

package google.codejam;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class Stark_C {

	/**
	 * @param args
	 */
	public static int getDig(int t1){
		if(t1==0) return 0;
		else if(t1<10) return 1; 
		else if(t1<100) return 2;
		else if(t1<1000) return 3;
		else if(t1<10000) return 4;
		else if(t1<100000) return 5;
		else if(t1<1000000) return 6;
		else return 7;
	}
	
	public static int times(int t){
		
		if(t==0)return 1;
		else	if(t==1)	return 10;
		else	if(t==2) return 100;
		else	if(t==3) return 1000;		
		else	if(t==4) return 10000;
		else	if(t==5) return 100000;		
		else	if(t==6) return 1000000;	
		else	if(t==7) return 10000000;
		else return 100000000;
	
	}
	
	public static void main(String[] args) throws Exception {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(new FileReader("C_small.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("C_small.out"));
		
		int total = sc.nextInt();
		
		
		
		for(int i=0; i<total; i++){
			
			pw.print("Case #" + (i + 1) + ": ");
			
			int t1 = sc.nextInt();
			int t2 = sc.nextInt();
			
			//pw.print(t1+"  "+t2+ "  ");
			
			int n=t1;
			int m=t2;
			int ans=0;
			
			while(n<t2){
				
				int te=10;
				while(m!=n){
					int divi = n/te;
					int rem = n%te;
					m = rem*times(getDig(divi))+divi;
					
					//pw.print("n= "+n+",m = "+m+";;;");					
					if(m>t1 && m>n && m<=t2) ans++;
					//pw.print("  ans-->"+ans+"  ");
					te = te*10;
					
				}
				
				
				n++;
			}
			
			
			
			
			pw.println(ans);
			
			
			
		}
		pw.flush();
		pw.close();
		sc.close();
	}
	
	

}
