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.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

public class MainClass {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(new File("C-large.in"));
		PrintWriter out = new PrintWriter(new File("RecycledNumbers.out"));

		int N = sc.nextInt();
		for (int i = 0; i < N; i++) {
			System.out.println("For case i: " + i);
			int A = sc.nextInt();
			int B = sc.nextInt();
			long count = 0;
			String s1 = "";
			for (int j = A; j <= B; j++) {
				s1 = "" + j;
				ArrayList<String> done = new ArrayList<String>();
				for (int k = 0; k < s1.length(); k++) {
					String tempS = s1;
					tempS = s1.substring(1) + s1.charAt(0);
					if (done.contains(tempS)) {
						continue;
					} else {
						s1 = tempS;
					}
					int temp = Integer.parseInt(s1);
					if ((temp < j) && (temp >= A) && (temp <= B)) {
						count++;
						done.add(s1);

					}

				}
			}
			out.println("Case #" + (i + 1) + ": " + count);
			System.out.println("**************");
		}
		out.close();

	}

}
