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.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;

public class Third {

	public static void main(String[] args) {

		try {
			BufferedReader reader = new BufferedReader(new FileReader(new File("input.txt")));
			PrintWriter writer = new PrintWriter(new FileWriter(new File("output.txt")));
			reader.readLine();
			int test = 1;
			String str = "";
			while((str = reader.readLine()) != null){
				long result = 0;
				String[] temp = str.split(" ");
				int a = Integer.parseInt(temp[0]);
				int b = Integer.parseInt(temp[1]);
				boolean[] visited = new boolean[b + 1];
				
				for(int num = a; num <= b; num++){
					if(visited[num]) continue;
					
					int[] digits = GetDigit(num);

					Set<Integer> recycledNum = new HashSet<Integer>();
					for(int i = 0; i < digits.length; i++){
						int thisNum = GetNum(digits, i);
						int thisNumDigit = (int) (Math.log10(thisNum) + 1);
						if(thisNum >= a && thisNum <= b && thisNumDigit == digits.length)
							recycledNum.add(thisNum);
					}
					if(recycledNum.size() > 1){
						result += recycledNum.size() * (recycledNum.size() - 1) / 2;
						Iterator<Integer> iterator = recycledNum.iterator();
						while(iterator.hasNext()){
							visited[iterator.next()] = true;
						}
					}
				}
				writer.println("Case #" + test + ": " + result);
				test++;
			}
			writer.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
	
	private static int[] GetDigit(long num){
		int digits = (int) (Math.log10(num) + 1);
		int[] result = new int[digits];
		while(digits > 0){
			result[--digits] = (int) (num % 10);
			num /= 10;
		}
		return result;
	}
	
	private static int GetNum(int[] digits, int startDigit){
		int number = 0;
		int pos = startDigit;
		do{
			number = number * 10 + digits[pos];
			pos++;
			if(pos >= digits.length) pos -= digits.length;
		} while(startDigit != pos);
		return number;
	}
}
