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

}
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {

	public static void main(String[] args) throws IOException {

		File file = new File("in.txt");
		Scanner scanner = new Scanner(file);
		FileWriter outFile = new FileWriter("out.txt");
		PrintWriter out = new PrintWriter(outFile);

		int N = scanner.nextInt();
		for (int i = 0; i < N; i++) {

			int A = scanner.nextInt();
			int B = scanner.nextInt();
			Set<String> set = new HashSet<String>();

			for (int n = A; n <= B; n++) {

				char[] c = Integer.toString(n).toCharArray();

				for (int k = 0; k < c.length - 1; k++) {

					char temp = c[c.length - 1];
					for (int l = c.length - 1; l > 0; l--) {
						c[l] = c[l - 1];
					}
					c[0] = temp;

					StringBuilder s = new StringBuilder();
					for (int l = 0; l < c.length; l++) {
						s.append(c[l]);
					}

					String m = s.toString();

					if (A <= Integer.parseInt(m) && Integer.parseInt(m) <= B
							&& n < Integer.parseInt(m)) {
						set.add(Integer.toString(n).concat(m));
					}

				}

			}

			out.println("Case #" + (i + 1) + ": " + set.size());

		}

		out.close();

	}
}
