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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.OutputStream;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;

public class RecycledNumbersClean {
	public static void main(String[] args) throws FileNotFoundException {

		Scanner in = new Scanner(
				new File(
						"/Users/olvitole/Dropbox/workspace/Googe Code/src/gcj2012/files/C-small-attempt1.in"));
		int t = Integer.parseInt(in.nextLine());
		OutputStream outStr = new FileOutputStream(
				"/Users/olvitole/Dropbox/workspace/Googe Code/src/gcj2012/files/C1s-output.txt");
		PrintStream printOut = new PrintStream(outStr);
		for (int zz = 1; zz <= t; zz++) {
			ArrayList<String> record = new ArrayList<String>();
			String input = in.nextLine().trim();
			String parts[] = input.split(" ");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			int count = 0;
			if (!(B <= 9)) {
				int iFliped = 0;
				String iFlipedString = "";
				String iString = "";

				for (int i = A; i <= B; i++) {
					iString = i + "";
					int first = 0;
					int second = 0;
					for (int j = 1; j < iString.length(); j++) {
						System.out.println();
						first = (int) (i / (Math.pow(10, j)));
						second = (int) (i % (Math.pow(10, j)));
						iFlipedString = "" + second + "" + first;

						iFliped = Integer.parseInt(iFlipedString);
						if (iFliped <= B && iFliped > i
								&& !iString.equals(iFlipedString)
								&& !record.contains(iString + iFlipedString)) {
							count++;
							record.add(iString + iFlipedString);
						} 
					}
				}
			}
			String output = count + "";
			printOut.append("Case #" + zz + ": " + output + "\n");
		}

		System.setOut(printOut);
	}

}
