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

import java.io.FileInputStream;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * Created by IntelliJ IDEA.
 * User: Yuri
 * Date: 14.04.12
 * Time: 12:18
 * To change this template use File | Settings | File Templates.
 */
public class Task3 {

    static int divider;

    static int recycle(int a) {
        int mod = a % divider;
        int digit = a / divider;
        return (mod * 10) + digit;
    }

    public static void main(String[] args) throws Exception {
        Scanner scanner = new Scanner(new FileInputStream("task31.txt"));
        int N = scanner.nextInt();
        Set<Integer> set = new HashSet<Integer>();
        for (int n = 0; n < N; n++) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();

            int digitsCount = String.valueOf(a).length();
            divider = (int) Math.pow(10, digitsCount - 1);
            int count = 0;
            for (int c = a; c <= b; c++) {
                set.clear();
                int recycled = c;
                for (int i = 0; i < digitsCount - 1; i++) {
                    recycled = recycle(recycled);
                    if (recycled <= b && recycled > c) {
                        if (! set.contains(recycled)) {
                            set.add(recycled);
                            count++;
                        }
                    }
                }
            }
            System.out.println("Case #" + (n + 1) + ": " + count);
        }
    }
}
