/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.StringTokenizer;

public class ProblemC {

	private static final String OUT = "C:/workspaces/tc/CodeJam/src/C.out";
	private static final String IN = "D:/downloads/C-small-attempt0.in";

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new FileReader(IN));
		BufferedWriter bw = new BufferedWriter(new FileWriter(OUT));
		int T = Integer.parseInt(br.readLine());
		for (int i = 0; i < T; i++) {
			StringTokenizer st = new StringTokenizer(br.readLine());
			String num = st.nextToken();
			int k = num.length();
			int A = Integer.parseInt(num);
			int B = Integer.parseInt(st.nextToken());
			int res = 0;
			int mult = 1;
			for (int j = 0; j < k - 1; j++) {
				mult *= 10;
			}
			Map<Integer, Set<Integer>> map = new HashMap<Integer, Set<Integer>>(2000000);
			for (int j = A; j <= B; j++) {
				int t = j;
				for (int l = 0; l < k - 1; l++) {
					int rem = t % 10;
					t = rem * mult + t / 10;
					if (t > j && t <= B && t >= A) {
						Set<Integer> set = map.get(j);
						if (set == null) {
							set = new HashSet<Integer>(6);
						}
						set.add(t);
						map.put(j, set);
					}
				}
			}
			for (Entry<Integer, Set<Integer>> entry : map.entrySet()) {
				res += entry.getValue().size();
			}
			bw.write("Case #" + (i + 1) + ": " + res + "\n");
		}
		bw.close();
	}
}
