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


package codejam2012.qualification;

import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class ProblemC {
    public static void main(String[] args) throws Exception {
        System.setIn(new FileInputStream("C-small-attempt0.in"));
        System.setOut(new PrintStream(new FileOutputStream("C-small-attempt0.out")));
        Scanner in = new Scanner(System.in);
        int testCase = in.nextInt();
        Set<Integer> duplicates = new TreeSet<>();
        
        for(int i = 1; i <= testCase; i++) {
            int a = in.nextInt(),
                b = in.nextInt();
            int count = 0;
            
            for(int n = a; n < b; n++) {
                String s = String.valueOf(n);
                String s2 = s+s;
                
                duplicates.clear();
                for(int j = 1, len = s.length(); j < len; j++) {
                    int m = Integer.parseInt(s2.substring(j, j+len));
                    if(m > n && m <= b && !duplicates.contains(m)) {
                        count++;
                        duplicates.add(m);
                    }
                }
            }
            System.out.printf("Case #%d: %d%n", i, count);
        }
    }
}
