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 info.m3o.gcj2012.recyclednumber;


public class MainRecycledNumber {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		// String infilepath = "C:\\eclipse\\workspace\\gcjRecycledNumber\\data\\inputTest.txt";
		
		// String infilepath = "C:\\eclipse\\git_home\\git\\gcjRecycledNumber1\\gcjRecycledNumber\\data\\inputLarge.txt";
		String infilepath = "C:\\eclipse\\git_home\\git\\gcjRecycledNumber1\\gcjRecycledNumber\\data\\inputSmall.txt";

		
		//		String infilepath = "C:\\eclipse\\workspace\\gcjRecycledNumber\\data\\inputSmall.txt";
		//		String infilepath = "C:\\eclipse\\workspace\\gcjRecycledNumber\\data\\inputLarge.txt";

		InputFileLoader inputFileLoader = new InputFileLoader(infilepath);


		inputFileLoader.readInputFile();


		int inT = Integer.valueOf(inputFileLoader.getRawInputLines().get(0));
		// Remove the fist line, which is no logner needed.
		inputFileLoader.getRawInputLines().remove(0);


		int inA, inB;
		int caseCount = 0;
		// System.out.println("T=" + inT);

		ResultUtil resultUtil = new ResultUtil();

		for (String line : inputFileLoader.getRawInputLines()){
			String[] s = line.split("\\s");

			inA = Integer.valueOf(s[0]);
			inB = Integer.valueOf(s[1]);
			// System.out.println("A=" + inA + "B=" + inB );
			caseCount++;

			/*
			 *  Start the actual Job
			 */
			resultUtil.clearSets();
			int n, numRecycledNumber;
			RecycledNumber recycledNumber;

			
			for (n = inA; n <= inB; n++) {
				recycledNumber = new RecycledNumber(n, inA, inB);
				recycledNumber.addRecycledNumbers(resultUtil.recycledNumberSet,
						resultUtil.testedNumberSet);
				for (String str : RecycledNumber.getCycledNumber(recycledNumber
						.getNumStr())) {
					recycledNumber.addRecycledNumbers(resultUtil.recycledNumberSet,
							resultUtil.testedNumberSet, str);
					
				}

				// recycledNumber.addRecycledNumbers(resultUtil.recycledNumberSet,
				// resultUtil.testedNumberSet);
			}			numRecycledNumber = resultUtil.recycledNumberSet.size();
			

			
			
			System.out.print("Case #"+ caseCount+": ");
			System.out.println(numRecycledNumber);
			/*
			for (MyNumberStringPair mnsp: resultUtil.recycledNumberSet){
				System.out.print(mnsp.getS1() + " " + mnsp.getS2() + " " );
			}
			System.out.println("END");
			*/
		}

		/*
		System.out.println("caseCount="+caseCount);
		*/
		assert (inT == caseCount) : "CaseCount mismatch";

	}

}
