
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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;


public class Recycle {
	public static void main(String...args) throws IOException  {
		//the result file
		PrintWriter writer = new PrintWriter(new FileWriter("c:\\jam\\C-small-attempt0.out"));
		//reading input file the file
		BufferedReader reader = new BufferedReader(new FileReader("c:\\jam\\C-small-attempt0.in"));
		//Reading cases number
		int count = Integer.parseInt(reader.readLine());
		
		//Iterating over the cases
		for(int k=1;k<count+1;k++){
			String g = reader.readLine();
			String[] tab = g.split("\\s");
			int A = Integer.parseInt(tab[0]);
			int B = Integer.parseInt(tab[1]);
			int res = 0;
			
			for(int n=A;n<B;n++){
				String str = "" + n;
				String origin = str;
				int size = str.length();
				String old = null;
				int c = 0;
				List<String> list = new ArrayList<String>();
				for(int i=0;i<size;i++){
					char first = str.charAt(0);
					str = str.substring(1).concat(first + "");
					boolean test = false;
					for(String s:list){
						if(s.equals(str)) test = true;
					}
					if(test) continue;
					list.add(str);
					c = Integer.parseInt(str);
					int size2 = String.valueOf(c).length();
					if(c>n && c<=B && size==size2){
						res++;
					}
					old = str;
				}
			}
			
			writer.println("Case #" + k + ": " + res);
		}
		
			reader.close();
			writer.close();
	}
}
