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

package numbers;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;

public class Solution {

	public static void main(String[] args) throws IOException {
		
		
		BufferedReader br = new BufferedReader(new FileReader("C-small0.in"));
		BufferedWriter wr = new BufferedWriter(new FileWriter("output"));
		
		Integer cases = Integer.valueOf(br.readLine());
		for (int caseNumber = 1; caseNumber<=cases; ++caseNumber){
			String[] line = br.readLine().split(" ");
			Integer A = Integer.valueOf(line[0]);
			Integer B = Integer.valueOf(line[1]);
			StringBuffer bf = new StringBuffer();
			bf.append("Case #");
			bf.append(caseNumber);
			bf.append(": ");
			
			if (A<11)
				A = 11;
			int counter = 0;
			for (int n=A; n<=B;++n){
				counter += findRecycled(n, B);
			}
			bf.append(counter);
			wr.write(bf.toString());
			wr.newLine();
			wr.flush();
		}

	}

	private static int findRecycled(int n, int limit) {
		
		int retVal = 0;
		HashSet<String> possibles = new HashSet<String>();
		String base = String.valueOf(n);
		for (int i=1; i<base.length();++i){
			String possibility = base.substring(i).concat(base.substring(0,i));
			possibles.add(possibility);
		}
		for (String possibility : possibles){
			int check = Integer.valueOf(possibility);
			if (check>n && check<=limit)
				++retVal;
		}
		return retVal;
	}

}
