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 codejam.qualification;

import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class Main {
	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(new File("input.txt"));
		FileWriter out = new FileWriter("output.txt");
		
		// ignore test cases
		in.nextLine();
		
		int count = 1;
		while (in.hasNext()) {
			out.write("Case #" + count++ + ": " + calc(in.nextLong(), in.nextLong()) + "\n");
		}
		
		out.flush();
		out.close();
		in.close();
	}
	
	public static long calc(long A, long B) {
		long count = 0;
		
		for (long n=A; n<B; n++) {
			String sNum = Long.toString(n);
			
			for (int x=1; x<sNum.length(); x++) {
				String sCan = sNum.substring(sNum.length() - x) + sNum.substring(0, sNum.length() - x);
				long m = Long.parseLong(sCan);
				
				if (A <= n && n < m && m <= B) {
					System.out.println(n + " " + sCan + " " + sNum.substring(sNum.length() - x));
					count++;
				}
			}
		}
		
		return count;
	}
}
