
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
package gcj2012.qualificationround;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintStream;
import java.util.LinkedHashMap;
import java.util.LinkedHashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {

	public static void main(String[] args) throws Exception {
		solve(System.in, System.out);
	}
	
	private static void solve(InputStream in, PrintStream out) throws IOException {
		Scanner scanner = new Scanner(in);
		int T = scanner.nextInt();
		for (int t=1; t<=T; t++) {
			
			final int A = scanner.nextInt();
			final int B = scanner.nextInt();
			
			Map<Integer, Set<Integer>> pairs = new LinkedHashMap<Integer, Set<Integer>>();
			for (int i=A; i<=B; i++) {
				pairs.put(i, new LinkedHashSet<Integer>());
			}
			for (int i=A; i<=B; i++) {
				String s = Integer.toString(i);
				for (int splitPoint=1; splitPoint<=numDigitsIn(A)-1; splitPoint++) {
					String sa = s.substring(0, splitPoint);
					String sb = s.substring(splitPoint);
					int newnum = Integer.parseInt(sb+sa);
					if (i < newnum && newnum <= B) {
						pairs.get(i).add(newnum);
					}
				}
			}
			
			int numRecycledPairs = 0;
			for (int n=A; n<B; n++) {
				numRecycledPairs += pairs.get(n).size();
			}
			
			out.printf("Case #%d: %d%n", t, numRecycledPairs);
		}
		scanner.close();
	}
	
	private static int numDigitsIn(int n) {
		return 1 + (int) (Math.log10(n));
	}
	
}
