/*
 * 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;
    }
}

/*
 * Google Code Jam 2012 - Qualification Round (14.04.2012)
 * Thomas "ThmX" DenorÃ©az - thomas.denoreaz@gmail.com
 */

package codejam._2012.qualif;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;

public class C {
	
	static final String FILENAME = "C-small-attempt0";

	public static void main(String[] args) throws NumberFormatException, IOException {
		
		BufferedReader reader = new BufferedReader(new FileReader(FILENAME + ".in"));
		PrintWriter writer = new PrintWriter(FILENAME + ".out");
		
		int N = Integer.valueOf(reader.readLine());
		for (int i=1; i<=N; i++) {
			
			String[] nums = reader.readLine().split(" "); // -> A B
			int A = Integer.valueOf(nums[0]);
			int B = Integer.valueOf(nums[1]);
			
			
			HashSet<String> set = new HashSet<String>();
			
			for (int n = A; n <= B; n++) {
				String nStr = String.valueOf(n);
				
				int nLen = nStr.length();
				for (int j = 1; j <= nLen-1; j++) {					
					String mStr = String.valueOf( Integer.valueOf( nStr.substring(nLen-j) + nStr.substring(0, nLen-j) ) );
					
					int m = Integer.valueOf(mStr);
					if ((mStr.length() == nStr.length()) && (n < m) && (m <= B)) {
						set.add(n + ":" + m);
					}
				}
				
			}
			
			writer.println("Case #" + i + ": " + set.size());
		}
		
		writer.flush();
		writer.close();
		reader.close();
	}

}
