
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.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;

public class Problem3 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		File file = new File("small-input.in");
		File outputFile = new File("output.txt");
		try {
			FileWriter writer = new FileWriter(outputFile);
			BufferedWriter out = new BufferedWriter(writer);
			Scanner scanner = new Scanner(file);
			int count = 0;
			
			while (scanner.hasNextLine()) {
				count = count + 1;
				String line = scanner.nextLine();

				if (count >= 2) {
					int finalCount = 0;
					System.out.println(line);
					String[] stringArr = line.split(" ");
					int num1 = Integer.parseInt(stringArr[0]);
					int num2 = Integer.parseInt(stringArr[1]);
					int tempnum1 = num1;
					//System.out.println("number1 is " + num1);
					//System.out.println("number2 is " + num2);
					for (; tempnum1 <= num2; tempnum1++) {
						String str = String.valueOf(tempnum1);
						ArrayList usedList = new ArrayList();
						for (int j = 1; j < str.length(); j++) {
							String str1 = str.substring(str.length() - j, str
									.length());
							String str2 = str.substring(0, str.length() - j);
							String newStr = str1 + str2;
							int newIntVal = Integer.parseInt(newStr);
							
							if ((num1 <= newIntVal) && ((num2 >= newIntVal))) {
								if(newIntVal>tempnum1){
									if(!usedList.contains(newIntVal)){
									System.out.println("tempNum1 is "+tempnum1);
									System.out.println("newIntVal== "+newIntVal);
									usedList.add(newIntVal);
								finalCount = finalCount+1;
								System.out.println("-------------------------------------------------------------");
								//System.out.println("finalCount is "+finalCount);
									}
								}
							}
						}

					}
                  
					out.write("Case #" + (count - 1) + ": "+finalCount);
					out.newLine();

				}

			}
			out.close();
			writer.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

}
