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.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;


public class main2 {

	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		// TODO Auto-generated method stub
		BufferedReader m = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter ou = new PrintWriter("file.txt");
		int n = Integer.parseInt(m.readLine());
	
		for (int i = 0; i < n; i++) {
			String cas = m.readLine();
			String [] a = cas.split(" ");
			int base = Integer.parseInt(a[0]);
			int count = 0;
			int count1=0;
			if(a[0].length()==1){
				System.out.print("Case #"+(i+1)+": "+count);

				System.out.print("\n");
			}else{
				Boolean con = false;;
				int cass = Integer.parseInt(a[0]);
				do {
//					 con = false;;
//				String newcase = a[0].charAt(0)+"";
//				for(int j=0  ;j<a[0].length()-1;j++ ){
//					newcase +=a[0].charAt(0)+"";;
//				}
		
				do{
					
					count1 = count;
					
					String newcase = cass+"";
					if (cass <Integer.parseInt(a[1])){
						con = true;
						for (int j = 0; j < newcase.length()-1; j++) {
							newcase = (newcase+newcase.charAt(0));
							newcase = newcase.substring(1,newcase.length());
							int cassM = Integer.parseInt(newcase);
							if (base <= cass && cass < cassM && cassM<=Integer.parseInt(a[1]))
								count++;
						}
					}
					cass++;
				}while(count1 <count);
				
//					String tmp = cass+"";
//					int first = Integer.parseInt(tmp.charAt(0)+"");
//					first++;
//					tmp = first+""+tmp.substring(1,tmp.length());
//					a[0]=tmp;
				
				}while(cass <= Integer.parseInt(a[1]));
				System.out.print("Case #"+(i+1)+": "+count);

				System.out.print("\n");
			}
		}
	}

}
