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.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class RecycledPairs {
	public static void main(String [] args) throws IOException {
		Scanner fileScan = new Scanner(new File("C-large.in"));
		BufferedWriter out = new BufferedWriter(new FileWriter("C-large.out"));
		
		int N = Integer.parseInt(fileScan.nextLine());
		for (int i = 0; i < N; i++) {
			int A = fileScan.nextInt();
			int B = fileScan.nextInt();
			int numPairs = 0;
			
			int numDigits = 0;
			int temp = A;
			while (temp > 0) {
				numDigits++;
				temp /= 10;
			}
			
			for (int n = A; n <= B; n++) {
				int check = 0;
				for (int j = 1; j < numDigits; j++) {
					int m = (int) (n/Math.pow(10, j) + (n%Math.pow(10, j))*Math.pow(10, numDigits-j));
					if (m > n && m <= B && m != check) {
						numPairs++;
						check = m;
					}
				}
			}
			
			int printTemp = i + 1;
			out.write("Case #" + printTemp + ": " + numPairs + "\n");
		}
		
		out.close();
	}
}
