/*
 * 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 codejam.qualification;

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


public class Main {
	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(new File("input.txt"));
		FileWriter out = new FileWriter("output.txt");
		
		// ignore test cases
		in.nextLine();
		
		int count = 1;
		while (in.hasNext()) {
			out.write("Case #" + count++ + ": " + calc(in.nextLong(), in.nextLong()) + "\n");
		}
		
		out.flush();
		out.close();
		in.close();
	}
	
	public static long calc(long A, long B) {
		long count = 0;
		
		for (long n=A; n<B; n++) {
			String sNum = Long.toString(n);
			
			for (int x=1; x<sNum.length(); x++) {
				String sCan = sNum.substring(sNum.length() - x) + sNum.substring(0, sNum.length() - x);
				long m = Long.parseLong(sCan);
				
				if (A <= n && n < m && m <= B) {
					System.out.println(n + " " + sCan + " " + sNum.substring(sNum.length() - x));
					count++;
				}
			}
		}
		
		return count;
	}
}
