
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.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class B {
	public static void main(String args[]) throws FileNotFoundException{
		//Scanner scanner = new Scanner(new FileInputStream("input.in"));
		Scanner scanner = new Scanner(System.in);
		int nt = scanner.nextInt();
		scanner.nextLine();
		//PrintWriter printWriter = new PrintWriter(new FileOutputStream("output.out"));
		PrintWriter printWriter = new PrintWriter(System.out);

		for (int i = 0; i < nt; i++) {
			printWriter.print("Case #"+(i+1)+": ");
			printWriter.println(solveIt(scanner.nextLine()));
		}
		printWriter.close();
		
	}

	private static String solveIt(String nextLine) {
		List<String> list= new ArrayList<String>(); 
		int A = Integer.parseInt(nextLine.split(" ")[0]);
		int B = Integer.parseInt(nextLine.split(" ")[1]);
		int result = 0;
		for (int i = A; i < B; i++) {
			String k = ""+i;
			for (int j = 0; j < k.length()-1; j++) {
				String k1 = k.substring(k.length()-(j+1), k.length()) + k.substring(0,k.length()-(j+1));
				if(Integer.parseInt(k1) > i && Integer.parseInt(k1) <= B){
					if(!list.contains(i+"--"+k1)){
						list.add(i+"--"+k1);
						result++;	
					}
				}	
			}
		}
		return result+"";
	}
}
