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.ArrayList;

public class Recycled
{
	public static void main(String[] args)
	{
		int T = StdIn.readInt();

		for(int tr = 1; tr <= T; tr++)
		{
			int A = StdIn.readInt();
			int B = StdIn.readInt();

			//total num of recycled
			int num = 0;

			for (int i = A; i <= B; i++)
			{
				//converts to string
				String temp = Integer.toString(i);

				//list of recycled numbers given m = i
				ArrayList<Integer> reNum = new ArrayList<Integer>();

				//for each shift
				for(int ind = 1; ind < temp.length(); ind++)
				{
					String first = temp.substring(0,ind);
					String last = temp.substring(ind);

					String shift = last + first;
					int shiftNum = Integer.parseInt(shift);

					if (shiftNum <= i || shiftNum > B)
						continue;

					if (reNum.indexOf(shiftNum) < 0)
					{
						reNum.add(shiftNum);
					}
				}

				num += reNum.size();
			}

			StdOut.println("Case #" + tr + ": " + num);
		}
	}
}
