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 recycled;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;

public class Main {

	public static void main(String[] args) throws IOException {
		File file = new File("C-large.in");
		FileReader fr = new FileReader(file);
		BufferedReader in = new BufferedReader(fr);
		
		String line=in.readLine();
		String[] tokens;
		int num = Integer.parseInt(line);
		int i=1;
		int A,B;
		String str;
		int n,count;
		while(i<=num){
			line=in.readLine();
			tokens = line.split(" ");
			A = Integer.parseInt(tokens[0]);
			B = Integer.parseInt(tokens[1]);
			count = 0;
			for(int m=A;m<B;m++){
				str = Integer.toString(m);
				for(int j=0;j<str.length()-1;j++){
					str = str.substring(1) + str.charAt(0);
					n = Integer.parseInt(str);
					if(n>m && n<=B){
						count++;
					}
					if(n==m){
						break;
					}
				}
			}
			
			System.out.println("Case #"+i+": "+count);
			i++;
		}
	}

}
