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

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class ProblemC {
	public static void main(String[] args) throws FileNotFoundException {
		// Scanner sc = new Scanner(new File("C-practice.in"));
		Scanner sc = new Scanner(new File("C-small.in"));
		// Scanner sc = new Scanner(new File("C-large.in"));
		int cases = sc.nextInt();
		for (int i = 1; i <= cases; i++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int count = 0;
			for (int j = A; j <= B; j++) {
				int number = recycle(j);
				while (number != j) {
					if (number > j && number <= B) {
						count++;
					}
					number = recycle(number);
				}
			}
			// do case things here
			System.out.format("Case #%d: %d\n", i, count);
		}
	}

	private static int recycle(int n) {
		int temp = n;
		int max = 1;
		while (temp >= 10) {
			max *= 10;
			temp /= 10;
		}
		int m = n / 10 + (max * (n % 10));
		temp = n;
		while (temp % 10 == 0) {
			temp = m;
			m = m / 10 + (max * (m % 10));
		}
		return m;
	}
}
