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

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

public class RecycledNumber 
{
	public static void main(String[] args) throws IOException
	{
		//open the file
		FileReader reader = new FileReader(args[0]);	   		
		BufferedReader input = new BufferedReader(reader);
		
		FileWriter fOut = new FileWriter("out.txt", false);
		BufferedWriter out = new BufferedWriter(fOut);
			
		//first line is the number of test cases
		int testCases = Integer.parseInt(input.readLine());
					
		for(int i = 0; i < testCases; i++)
		{			
			String line = input.readLine();
			System.out.println(line);
			
			int answer = 0;
			
			String[] ab = line.split(" ");

			int a = Integer.parseInt(ab[0]);	
			int b = Integer.parseInt(ab[1]);
			
			int n = a;
			int m = b;
			
			//figure out the length we are dealing with
			int length = (int)(Math.log10(a)+1);
			
			HashMap<Integer,Integer> matches = new HashMap<Integer,Integer>();
			
			for(int j = n; j < m; j++)
			{
				for(int k = m; k > j; k--)
				{
					//now, shift digits from back of j and compare to k
					String shifter = String.valueOf(j);
					for(int shift = 1; shift < length; shift ++)
					{						
						String front = shifter.substring(0,shift);
						String back = shifter.substring(shift, shifter.length());
						
						//no leading zeroes after shift
						if(!back.startsWith("0"))
						{							
							int shiftedInt = Integer.parseInt(back + front);
							
							//match!
							if(shiftedInt == k 
									&& (!matches.containsKey(shiftedInt) || matches.get(shiftedInt) != j)
									)
							{
								answer++;
								matches.put(shiftedInt, j);							
							}
						}
					}				
				}
			}
						
			out.write("Case #" + (i + 1) + ": " + answer + "\n");
			System.out.println(answer);			
		}
		
		out.close();
	}
}
