
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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class RecycledNumbers {

	public static FileReader fileReader;
	public static BufferedReader reader;
	public static FileWriter fileWriter;
	public static BufferedWriter writer;

	public void executeLogic() throws Exception {

		String newLine;

		newLine = reader.readLine();
		int increment = 1;

		while ((newLine = reader.readLine()) != null) {
			int totalNumberCount = 0;
			String stringToArray[] = newLine.split("\\s");
			int A = Integer.parseInt(stringToArray[0]);
			int B = Integer.parseInt(stringToArray[1]);

			for (int i = A; i <= B; i++) {
				int n = i;
				String stringValueOfA = Integer.toString(n);
				int numberOfDigitsInA = stringValueOfA.length();
				int backIndex = numberOfDigitsInA - 1;
				String tempStringValueOfA = stringValueOfA;
				while (backIndex > 0) {

					String first = tempStringValueOfA.substring(0, backIndex);
					String second = tempStringValueOfA.substring(backIndex,
							numberOfDigitsInA);
					stringValueOfA = second + first;
					int m = Integer.parseInt(stringValueOfA);
					if ((m <= B && m > n)
							&& !stringValueOfA.startsWith("0")
							&& (Integer.toString(n).length()) == stringValueOfA
									.length())
						totalNumberCount++;

					backIndex--;

				}
			}

			writer.write("Case #" + increment++ + ": " + totalNumberCount
					+ "\n");

		}
		writer.close();
		fileWriter.close();

	}

	public static void main(String[] args) throws Exception

	{
		RecycledNumbers recycledNumbers = new RecycledNumbers();

		String inputFilePath = "C:\\CodeJamFiles\\Small2.in";
		String outputFilePath = "C:\\CodeJamFiles\\Small2.out";

		fileReader = new FileReader(inputFilePath);
		reader = new BufferedReader(fileReader);
		fileWriter = new FileWriter(outputFilePath, false);
		writer = new BufferedWriter(fileWriter);

		recycledNumbers.executeLogic();

	}

}
