import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

package fixjava;

/**
 * Convenience class for declaring a method inside a method, so as to avoid code duplication without having to declare a new method
 * in the class. This also keeps functions closer to where they are applied. It's butt-ugly but it's about the best you can do in
 * Java.
 * 
 * <code>
			final HashSet<String> allNames = new HashSet<String>();
			Lambda<Set<String>, Void> addAllIfNotNull = new Lambda<Set<String>, Void>() {
				public Void apply(Set<String> newNames) {
					if (allNames != null)
						allNames.addAll(newNames);
					return null;
				}
			};
			allNames.add(cell.getName());
			addAllIfNotNull.apply(cell.getValues("Main_name"));
			addAllIfNotNull.apply(cell.getValues("Other_name"));
			addAllIfNotNull.apply(cell.getValues("Tree_node"));
			addAllIfNotNull.apply(cell.getValues("Lineage_name"));
 * </code>
 */

public interface Lambda<P, V> {
	public V apply(P param);
}
