package fixjava;

public class StringUtils {

	/** Repeat the given string the requested number of times. */
	public static String repeat(String str, int numTimes) {
		StringBuilder buf = new StringBuilder(Math.max(0, str.length() * numTimes));
		for (int i = 0; i < numTimes; i++)
			buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the left hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padLeft(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(padChar);
		for (int i = 1, mi = bufSize - str.length(); i < mi; i++)
			buf.append(padChar);
		buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the right hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padRight(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(str);
		buf.append(padChar);
		while (buf.length() < bufSize)
			buf.append(padChar);
		return buf.toString();
	}

	/** Intern all strings in an array, skipping null elements. */
	public static String[] intern(String[] arr) {
		for (int i = 0; i < arr.length; i++)
			arr[i] = arr[i].intern();
		return arr;
	}

	/** Intern a string, ignoring null */
	public static String intern(String str) {
		return str == null ? null : str.intern();
	}

}

import java.util.*;
import java.lang.*;

public class recyce{
   
   public static int count(int A, int B)
   {      
      HashSet<Integer> set;
      int count = 0;
      int n = (int) Math.log10(A)+1; 
      for(int num = A; num <= B; num++)
      {
         int rem = num;
         int base = 1;
         set = new HashSet<Integer>();
         for(int k = 1; k < n; k++)
         {
            base *= 10;
            int love = rem/base + (num%base)*((int)Math.pow(10.,n-k));
            if(love > num && love >= A && love <= B)
            {
                if(!set.contains(love))
                {
                    set.add(love);
                    count++;
               // System.out.println(num + " " + love);
                }
            }
         }
      }
      return count;
   }


   public static void main(String[] args)
   {
      Scanner in = new Scanner(System.in);
      int T = in.nextInt();

      int A,B;
      for(int i = 0; i < T; i++)
      {
         A = in.nextInt();
         B = in.nextInt();
         System.out.println("Case #" + (i+1) + ": " + count(A,B));
      }

   }

}
