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.HashMap;
import java.util.Scanner;


public class RecycledNumbers {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		int T = in.nextInt();
		
		for (int i = 1; i <= T; i++) {
			int A = in.nextInt();
			int B = in.nextInt();
			
			int numberOfRecycledPairs = findNumberOfRecycledPairs(A, B);
			System.out.format("Case #%d: %d\n", i, numberOfRecycledPairs);
		}
	}
	
	private static int findNumberOfRecycledPairs(int start, int end)
	{
		HashMap<String, String> recycledPairs = new HashMap<String, String>();
		for(int i = start; i <= end; i++)
		{
			int originalNumber = i;
			String numberStr = originalNumber + "";
			int numberLength = numberStr.length();
			for(int j = 1; j < numberLength; j++)
			{
				String newNumberStr = numberStr.substring(numberLength - j) + numberStr.substring(0, numberLength - j);
				int newNumber = Integer.parseInt(newNumberStr);
				if(newNumber >= start && newNumber <= end && newNumber > originalNumber)
					recycledPairs.put(originalNumber + "::" + newNumber,"");
			}
		}
		return recycledPairs.size();
	}

}
