
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.util.Scanner;

//"c:\Program Files\Java\jdk1.6.0_25\bin\javac.exe"  a.java
//"c:\Program Files\Java\jdk1.6.0_25\bin\java.exe"  a <test.in >test.out
public class C {

	public static String meth1 (String s){
		String res = "";
		res=res+s;
		
	return res;	  
	}
	//"c:\Program Files\Java\jdk1.6.0_25\bin\javac.exe"  A.java
	//"c:\Program Files\Java\jdk1.6.0_25\bin\java.exe"  A <test.in >test.out
	 static Scanner sc = new Scanner(System.in);
	 public static void main(String[] args) {
	  int cases  ;
	  int res;
	 int m=0;
	   
	  String tmp;
	
	  cases =  Integer.parseInt(sc.nextLine());  
	  int A,B;
	  String buff;
	  for(int id = 1; id <= cases; id++){
		  res=0;
		  buff="";
		   A = sc.nextInt();
		   B = sc.nextInt();sc.nextLine();
			  for (int i = A;i<=B;i++){
				tmp = i+"";
				for(int j =1;j<tmp.length();j++){
		 m = Integer.parseInt(tmp.substring(j,tmp.length() )+tmp.substring(0, j));
		
			if (m>i&&m<=B)
				if(!buff.contains( tmp+"#"+m)){
					res++;
					buff+= tmp+"#"+m+")(";
				}
				}

			  }
		  
		  
		  System.out.printf("Case #%d: %d%n", id, res);
	 
	  }
	 }
}