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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;


public class RecycledNumbers {
	public static void main(String args[]) throws IOException{
		String inputFile = args[0];
		String outputFile = args[1];
		BufferedReader input = new BufferedReader(new FileReader(inputFile));
		PrintWriter   output = new PrintWriter(outputFile);
		
		int testcases = Integer.valueOf(input.readLine());
		int testcase  = 0;
		while (testcase++ < testcases) {
			int result = 0;
			String newline = input.readLine();
			String tokens[] = newline.split(" ");
			long A = Long.valueOf(tokens[0]);
			long B = Long.valueOf(tokens[1]);
			
			int digit = 1;
			long baseAndMask = 10;
			long dummyA = A;
			while ((dummyA = dummyA / 10) > 0) {
				digit++;
				baseAndMask *= 10;
			}
			
			long i;
			for (i = A; i < B; i++) {
				int k = digit;
				long recycled = i * baseAndMask + i;
				while (k-- > 0) {
					long j = recycled % baseAndMask;
					if (j <= B && j > i) {
						result++;
					}
					recycled = recycled / 10;
				}
			}
			
			output.printf("Case #%d: %d\n", testcase, result);
		}
		
		output.close();
	}
}
