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

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try{
			//read file
			FileReader filein = new FileReader(args[0]);
			BufferedReader in = new BufferedReader(filein);
			//write file 
			FileWriter fileout = new FileWriter("output.txt");
			BufferedWriter out = new BufferedWriter(fileout);
			//process data
			int numcases = Integer.valueOf(in.readLine()).intValue();
			for(int i=0; i<numcases; i++){
				String[] casedata = in.readLine().split(" ");
				int minnum = Integer.valueOf(casedata[0]);
				int maxnum = Integer.valueOf(casedata[1]);
				int pos = casedata[0].length();
				int result = 0;
				for(int j=minnum; j<maxnum; j++){
					for(int k=j+1; k<=maxnum; k++){	
						if(j == k) result++;
						String numtest = String.valueOf(j);
						for(int l=0; l<pos; l++){
							char temp = numtest.charAt(0);
							numtest = numtest.substring(1)+temp;
							if(Integer.valueOf(numtest).intValue() == k){
								result++;
								break;
							}
						}
					}
				}
				out.write("Case #" + (i+1) + ": " + result + "\n");
			}
			//Close the output stream
			out.close();
			//Close the input stream
			in.close();
		}catch (Exception e){//Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}
}
