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

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class ProblemC {
	
	public static void main(String args[]) throws IOException{
		File file = new File("I:/res/ACMCS/GCJ/C-small-attempt0.in");
		File outFile = new File("I:/res/ACMCS/GCJ/problemC.out.txt");
		FileWriter fw = new FileWriter(outFile);
		BufferedWriter bw = new BufferedWriter(fw);
		//FileReader fileReader = new FileReader(file);
		Scanner in = new Scanner(file);
		int cs = in.nextInt();
		int c = 0;
		while(cs -- > 0){
			++ c;
			int ans = 0;
			int A = in.nextInt();
			int B = in.nextInt();
			for(int i = A; i <= B; ++ i)
				for(int j = i + 1; j <= B; ++ j)
					if(isRecycle(i, j)) ++ ans;
			bw.write("Case #");
			bw.write(String.valueOf(c));
			bw.write(": ");			
			bw.write(String.valueOf(ans));
			bw.newLine();
		}
		bw.close();
	}
	
	public static boolean isRecycle(int n, int m){
		String str = String.valueOf(n);
		int len = str.length();
		int mapN[] = new int[len];
		for(int i = len - 1; i >= 0; -- i){
			mapN[i] = n % 10;
			n /= 10;
		}
		int mapM[] = new int[len];
		for(int i = len - 1; i >= 0; -- i){
			mapM[i] = m % 10;
			m /= 10;
		}
		for(int i = 0; i < len; ++ i){
			boolean flag = true;
			for(int j = i, k = 0; k < len; ++ k){
				if(mapN[(j + k) % len] != mapM[k]) {flag = false;break;}
			}
			if(flag) return true;
		}
		return false;
	}
}





