package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

package fixjava;

import java.util.ArrayList;
import java.util.HashMap;

/**
 * Get the index of the given key if this key has been assigned an index before, and if not, allocate a new index for it by
 * incrementing a counter that starts at zero, and return the new index.
 */
public class UniqueIndexAllocator<T> {

	private HashMap<T, Integer> map = new HashMap<T, Integer>();
	private ArrayList<T> orderedKeys = new ArrayList<T>();

	public UniqueIndexAllocator() {
	}

	/** Allocate unique indices for each item in the given collection. Read back the indices using the other methods. */
	public UniqueIndexAllocator(Iterable<T> collection) {
		for (T it : collection)
			getOrAllocateIndex(it);
	}

	/** Get the assigned index for a key, or assign it a new unique index if this key has not previously been assigned an index */
	public int getOrAllocateIndex(T key) {
		Integer currIdx = map.get(key);
		if (currIdx == null) {
			map.put(key, currIdx = orderedKeys.size());
			orderedKeys.add(key);
		}
		return currIdx;
	}

	/** Get all the keys as a list in their index order */
	public ArrayList<T> getOrderedKeys() {
		return orderedKeys;
	}

	/** Get all the keys as an array in their index order */
	@SuppressWarnings("unchecked")
	public T[] getOrderedKeysAsArray() {
		return (T[]) orderedKeys.toArray();
	}

	/** Get the mapping from key to index */
	public HashMap<T, Integer> getKeyToIndexMap() {
		return map;
	}

	/** Return the number of allocated indices, i.e. the number of unique keys */
	public int numIndices() {
		return orderedKeys.size();
	}
}
