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 C {
	String cycle(String s) {
		return s.substring(1) + s.charAt(0);
	}

	void run() {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for (int t=1; t<=T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();
			long res = 0;
			for (long i=A; i<=B; i++) {
				long cnt = 1;
				String str = String.valueOf(i);
				for (String nowstr = cycle(new String(str));
						!nowstr.equals(str); nowstr = cycle(nowstr)) {
					if (nowstr.charAt(0) != 0) {
						int nowint = Integer.parseInt(nowstr);
						if (nowint >= A && nowint <= B) {
							if (nowint < i) {
								cnt = 0;
								break;
							} else {
								cnt++;
							}
						}
					}
				}
				res += cnt*(cnt-1)/2;
			}
			System.out.println("Case #" + t + ": " + res);
		}
	}

	static public void main(String[] args) {
		C obj = new C();
		obj.run();
	}
}
