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

public class C implements Runnable{

	public void run(){
		try{
			Scanner in = new Scanner(new File("C-large.in"));
			PrintWriter out = new PrintWriter("C-large.out");
			int a, b, t = in.nextInt(), ans, x, l;
			String min, buf, max;
			Set<String> set = new HashSet<String>();
			for (int k = 1; k <= t; k++){
				ans = 0;
				a = in.nextInt();
				b = in.nextInt();
				max = Integer.toString(b);
				for (int i = a; i < b; i++){
					set.clear();
					x = i;
					min = buf = Integer.toString(x);
					l = min.length();
					for (int j = 0; j < l-1; j++){
						buf = min.substring(l - j - 1) + min.substring(0, Math.max(0, l - j - 1));
						if ((buf.length() == l) && (min.compareTo(buf) < 0) && (buf.compareTo(max) <= 0)) {
							if (!set.contains(buf)){
								set.add(buf);
								ans++;
							}
						}
					}
				}
				out.println("Case #" + k + ": " + ans);
			}
			out.close();
		}
		catch(Exception e){
		}                                         
	}

	public static void main(String[] args){
		(new Thread(new C())).start();
	}
}                       