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 sun.rmi.runtime.NewThreadAction;

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

/**
 * Created by IntelliJ IDEA.
 * User: Veniversum
 * Date: 4/15/12
 * Time: 2:26 AM
 */
public class Q3 {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream("in.txt")));
            Scanner scanner = new Scanner(new FileInputStream("in.txt"));
            int cases = scanner.nextInt();
            scanner.nextLine();
            String output="";
            for (int i= 0;i<cases;i++){
                HashSet<String> results = new HashSet<String>();
                Scanner sc = new Scanner(scanner.nextLine());
                int A = sc.nextInt();
                int B = sc.nextInt();
                int n;
                int m;
                for (int j = A; j <= B;j++) {
                    n = j;
                    m = j;
                    String str = ("" + m);
                    for (int k = 0; k < ("" + m).length();k++) {
                        if (A <= n && n < m && m <= B) {
                            results.add(m + "," + n);
                        }
                        str = str.concat("" + str.charAt(0)); //adds first digit to end
                        str = str.substring(1); //remove first digit
                        m = Integer.parseInt(str);
                    }
                }
                output += "Case #" + (i+1) + ": " + results.size() + "\n";
                PrintWriter outp = new PrintWriter(new FileOutputStream("out.txt"));
                  outp.print(output);
                outp.close();
            }
            System.out.print(output);
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        } catch (IOException e) {
            e.printStackTrace();
        }

    }
}
