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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;

public class RoundOneProblemC {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		
		BufferedReader input = new BufferedReader(new FileReader("input.txt"));
		BufferedWriter output = new BufferedWriter(new FileWriter("output.txt"));
		
		int noOfTestCases = Integer.parseInt(input.readLine());
		
		for(int i=1;i<=noOfTestCases;i++)
		{
			String inputLine = input.readLine();
			String strArr[] = inputLine.split("\\s+");
			int a = Integer.parseInt(strArr[0]);
			int b = Integer.parseInt(strArr[1]);
			
			String bStr = Integer.toString(b);
			
		    char firstBDigit = bStr.charAt(0);
			
			int no = 0;
			for(int num=a;num<=b;num++)
			{
				String numStr = Integer.toString(num);
				
				char firstChar = numStr.charAt(0);
				
				//if(firstChar == firstBDigit)
					//continue;
				
				for(byte k=1;k<numStr.length();k++)
				{
					if(numStr.charAt(k)>=firstChar && numStr.charAt(k)<=firstBDigit)
					{
						int newNumber = Integer.parseInt(numStr.substring(k) + numStr.substring(0,k));
						
						if(newNumber <= b && newNumber > num)
						{
							
							no++;
						}
						
						
					}
				}
				
			}
			
			output.write("Case #" + i + ": " + no + "\n");
		}
		
		input.close();
		output.close();

	}
	
	
}
