package codejam;

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

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.*;
import java.util.*;
 
public class test {

    public static void main(String[] args) throws IOException {
 
        // Location of file to read

	functions aa = new functions();
        File file = new File("input.txt");
	Writer output = new BufferedWriter(new FileWriter("output.txt"));
	int i = 1;
	int answer = 0;
	String A = "";
	String B = "";
	int j = 0;
	int n = 0;
	
        try {
 
            Scanner scanner = new Scanner(file);
 	    n = Integer.parseInt((String)scanner.nextLine());
 	    
            while (scanner.hasNextLine()) {
            	A = "";
            	B = "";
                String line = scanner.nextLine();
                while(line.charAt(j) != ' '){
			A = A + line.charAt(j);
			j++;
                }
                j++;
                while(j < line.length()){
			B = B + line.charAt(j);
			j++;
                }
		j = 0;
                answer = aa.solve(A,B);
			if(i < n)
				output.write("Case #" + i +": "+ answer +"\n");
			else
				output.write("Case #" + i +": "+ answer);
		i++;
		
            }
            scanner.close();
            output.close();
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
       }
      }
