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

public class SimpleNumbers {
	public static boolean[] masInt;

	public static void initSimpleInt(int n) { // âõîäíûå äàííûå
		masInt = new boolean[n + 1];
		for(int i=0; i<=n;i++){
			masInt[i] = true;
		}
		masInt[0] = masInt[1] = false; // åñëè êòî-òî áóäåò èñïîëüçîâàòü ýòè
		// çíà÷åíèÿ
		for (int i = 2; i <= n; ++i) {
			if (masInt[i]) {
				for (int j = i + i; j < n; j += i) {
					masInt[j] = false;
				}
			}
		}
	}

	public static void main(String[] args) {
		initSimpleInt(1000000);
		int col = 0;
		int max = 0;
		for (int i = 0; i < 1000000; i++) {
			if (masInt[i]) {
				col++;
				max = i;
			}
		}
		System.out.println(max);
		System.out.println(col);
	}
}
