
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;

public class RecycledNumbers {

   public static void main(String[] argv) {

      int lineCount,counter,mHold;
      int n,m,recycledNumbers;
      Scanner input = null;
      try { input = new Scanner(System.in); }
      catch (Exception e) { System.err.println("FileNotFoundException: " + e.getMessage()); }

      lineCount = input.nextInt();

      for (counter = 0; counter < lineCount; counter++) {
         recycledNumbers = 0;
         input.nextLine();
         n = input.nextInt();
         mHold = input.nextInt();
         m = mHold;

         for (; n < m; n++) {
            for (; m > n; m--) {
               if (Integer.toString(n).length() == Integer.toString(m).length()) {
                  if (checkRecycled(n,m))
                     recycledNumbers++;
               }
            }
            m = mHold;
         }
         
         System.out.printf("Case #%d: %d\n",counter+1,recycledNumbers);
      }
   }

   public static boolean checkRecycled(int n, int m) {
      int check,cursor;
      String toCheck;
      String holder = Integer.toString(n);

      for (cursor = holder.length() - 1; cursor > 0; cursor--) {
         toCheck = "";
         toCheck += holder.substring(cursor,holder.length());         
         toCheck += holder.substring(0,cursor);
         check = Integer.valueOf(toCheck);
         if (check == m)
            return true;
      }
      return false;
   }

}
