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

public class Recycle
{
  public static void main(String[] args)
  {
    Scanner in = new Scanner(System.in);
    
    int nums = in.nextInt();
    
    for (int p = 0; p < nums; p++)
    {
      
      int a = in.nextInt();
      int b = in.nextInt();
      
      int length = (a + "").length();
      int pairs = 0;
      int numRepeats = 0;
      
      for (int f = a; f <= b; f++)
      {
        int temp = f;
        int save = temp;
        HashSet<Integer> set = new HashSet<Integer>();
        for (int i = 0; i < length; i++)
        {
          // bring to front
          int last = temp % 10;
          temp = temp / 10;
          temp += last * Math.pow(10, length - 1);
          
          if (temp > save && temp >= a && temp <= b && !set.contains(temp))
          {
            pairs++;
            set.add(temp);
          }
        }
        

      }
      System.out.println("Case #" + (p + 1) + ": " + (pairs  - numRepeats));
    }
  }
}