import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
import java.io.*;
import java.util.*;
// read file name frome command line
public class ProblemC{
	public static void main(String args[]){
	
		
		try{
			// reading file initialization
			String 			filename = args[0];
			FileReader 		frStream = new FileReader(		filename);
			BufferedReader 	brStream = new BufferedReader(	frStream);
			// writing file initializtion
			FileWriter     fwStream = new FileWriter(		filename.substring(0, filename.length()-3)+"Output.in" );
			BufferedWriter bwStream = new BufferedWriter( 	fwStream  );
			PrintWriter    pwStream = new PrintWriter(    	bwStream  );
			
			String text = brStream.readLine();
			int numCase =  Integer.parseInt( text );


                        for( int i = 0 ; i < numCase ; i++){
                            text = brStream.readLine();
                            StringTokenizer currLine = new StringTokenizer( text );
                            int min = Integer.parseInt(currLine.nextToken());
                            int max = Integer.parseInt(currLine.nextToken());
                            int counter = 0;
                            for( int j = min ; j < max ; j++){
                                String number =""+j;
                                for( int k = 1 ;k < number.length(); k++){
                                    String pairnumber=number.substring(k)+number.substring(0,k);
                                    int pair=Integer.parseInt(pairnumber);
                                    if(pair > j  && pair <= max ){
                                        counter++;
                                        continue;
                                    }
                                }
                            }
                           pwStream.println ("Case #" + (i+1) + ": " +counter);
                    }
			// close all I/O files
			brStream.close();
			pwStream.close();
			
		}
		catch(IOException e){}
	}
}