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);
		}
	}
}
package qualification;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class C {

	/**
	 * @param args
	 */
	static int number (int num){
		int i=0;
		while (num!=0){
			num/=10;
			i++;
		}
		return i-1;
	}
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader(new FileReader("C-large.in"));
		PrintWriter out = new PrintWriter((new FileWriter("C-large.out")));
		StringTokenizer st ;
		int tekrar = Integer.parseInt(f.readLine());
		
		for (int j=0;j<tekrar;j++){
			st = new StringTokenizer(f.readLine());
			int min = Integer.parseInt(st.nextToken());
			int max =  Integer.parseInt(st.nextToken());
			int count =0;
			for (int i=min;i<=max;i++){
				int num = i;
				num = (int) ((num%10)*Math.pow(10, number(num)))+num/10;
				while (num != i){
					while (number(i) != number(num)){
						num = (int) ((num%10)*Math.pow(10, number(i)))+num/10;
						if (num == i)
							break;
					}
					if (num == i)
						break;
					
					if (num>=min && num<=max ){
						count ++;
					}
					num = (int) ((num%10)*Math.pow(10, number(num)))+num/10;
				}
			}
			out.println("Case #"+(j+1)+": "+count/2);
		
		}
		out.close();
		System.exit(0);

	}

}
