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


public class RecycledNumbers {
	public static void main(String[]args){
		Scanner sc = new Scanner(System.in);
		//Read in the T int -- Test Cases
		int T = Integer.parseInt(sc.nextLine());
		for (int t = 1; t <= T; t++) {
			int num = 0;
			//START OF CODE
			int a = sc.nextInt();
			int b = sc.nextInt();
			int focus = a;
			
			for (int i = 0; focus < b; i++) {
				String f = focus + "";
				boolean distinct = true;
				/*all:for (int j = 0; j < f.length(); j++) {
					for (int j2 = j+1; j2 < f.length(); j2++) {
						if(f.charAt(j) == f.charAt(j2)){
							distinct = false;
							break all;
						}
					}
				}
				distinct = true;*/
				if(distinct){
					for (int j = 0; j < f.length() - 1; j++) {
						f = f.charAt(f.length()-1) + f.substring(0,f.length()-1);
						int fs = Integer.parseInt(f);
						if(fs <= b && f.charAt(0) != '0' && fs > focus){
							//System.out.println(focus+ " "+ f);
							num++;
						}
					}	
				}
				
				focus++;
			}
			//END OF CODE
			//OUTPUT
			System.out.format("Case #%d: %d\n", t, num);
		}
	}
}
