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;

public class RecycledNumber {

	public int deal(int A, int B)
	{
		int ans = 0;
		for (int i = A; i<= B ; i ++)
		{
			int left = i;			
			int k = 1;
			int tk = 1;		
			UniqueList newInts = new UniqueList(10);
			while (left >= 10)
			{
				left = left / 10;
				tk = tk * 10;
			}
			left = i;
			while (k * 10 <= left)
			{
				k = k * 10;
				int x = (left % k) * (tk * 10 / k) + (left / k);
				//System.out.println(i + ": " + x);
				if (x > i && x <= B)
					newInts.add(x);
			}
			ans += newInts.getSize();
		}
		return ans;
	}
	
	public void solve()
	{
		Scanner scan = new Scanner(System.in);
		int T = scan.nextInt();scan.nextLine();
		for (int i = 1; i <= T; i ++)
		{
			int A = scan.nextInt();
			int B = scan.nextInt();
			System.out.println("Case #" + i + ": " + this.deal(A, B));
		}
	}
	
	public static void main(String args[])
	{
		RecycledNumber r = new RecycledNumber();
		r.solve();
	}
}
