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.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Scanner;

// Qualification Round 2012
// Problem C

public class RecycledNumbers {

	public static void main(String[] args) {
		Scanner sc = null;
		try {
			sc = new Scanner(new File("C-large.in"));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}

		PrintStream output = null;

		try {
			output = new PrintStream(new File("C-large.out"));
		} catch (IOException e) {
			e.printStackTrace();
		}

		int cases = sc.nextInt();
		sc.nextLine();

		for(int c = 0; c < cases; c++){
			int A = sc.nextInt();
			int B = sc.nextInt();
			HashSet<String> pairs = new HashSet<String>(); 

			for(int n = A; n <= B; n++){
				String testn = n + "";
				String testm = testn;
				int l = testn.length();

				for(int i = 0; i < l - 1; i++){
					testm = testm.charAt(l - 1) + testm.substring(0, l - 1);
					int m = Integer.parseInt(testm);
					if(n < m && m <= B && m > A){
						pairs.add(n + " " + m);
					}
				}

			}
			
			System.out.printf("Case #%d: %s\n", c + 1, pairs.size());
			output.printf("Case #%d: %s\n", c + 1, pairs.size());
		}
	}
}
