import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
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;
   }

}
