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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class RecycledNumber {

	private static int A = 1111;
	private static int B = 2222;
	public static int count = 0;

	public static void main(String[] args) {
		String[] s ;
		BufferedReader br = null;
		try {
			br = new BufferedReader(new FileReader("src/com/problemC/C-small-attempt0.in"));
			int caseNo = 1;
			int T = Integer.parseInt(br.readLine());
			while (caseNo <= T) {
				count = 0;
				s = br.readLine().split(" ");
				A = Integer.parseInt(s[0]);
				B = Integer.parseInt(s[1]);
				for (int i = A; i <= B; i++) {
					rotate(i);
				}
				System.out.println("Case #" + caseNo++ + ": " + count);
			}
		} catch (NumberFormatException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		} finally{
			try {
				if(br != null){
					br.close();
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			
		}
	}

	private static void rotate(int num) {
		int l = (num + "").length(), l2;
		int toCut = 1;
		int original = num, newNum;
		String s = num + "", firstPart, secondPart;
//		 System.out.println(s);
		for (toCut = 1; toCut < l; toCut++) {
			firstPart = s.substring(0, l - toCut);
			secondPart = s.substring(l - toCut);
			newNum = Integer.parseInt(secondPart + firstPart);
//			 System.out.println(firstPart + " "+secondPart +": "+newNum);
			l2 = (newNum + "").length();
			if (l == l2 && newNum > original && newNum <= B) {
//				System.out.println(original + " " + newNum);
				count++;
			}
		}
	}
}
