/*
 * 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 com.ravi;

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {
	private static boolean matches(String a, String b) {
		if (a.equals(b)) {
			return false;
		}
		for (int j = 0; j < a.length(); j++) {
			if (!b.contains("" + a.charAt(j))) {
				return false;
			}
			// Remove the matched character
			b = b.replaceFirst("" + a.charAt(j), "");
		}
		return true;
	}

	private static Integer getRecycledPairs(String A, String B) {
		int a = Integer.parseInt(A);
		int b = Integer.parseInt(B);
		if (a < 10 || b < 10) {
			return 0;
		}

		Set<String> pairs = new HashSet<>();
		for (int n = a; n <= b; n++) {
			for (int m = a + 1; m <= b; m++) {
				if (n < m) {
					String nStr = n + "";
					String mStr = m + "";
					if (matches(nStr, mStr)) {
						for (int i = 0; i < nStr.length() - 1; i++) {
							String newNStr = nStr.substring(i + 1)
									+ nStr.substring(0, i + 1);
							if (newNStr.equals(mStr)) {
								pairs.add(nStr + "," + mStr);
							}
						}
					}
				}
			}
		}
		return pairs.size();
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		in.nextLine();
		for (int i = 1; i <= T; i++) {
			String thisLine = in.nextLine();
			String[] AB = thisLine.split(" ");
			System.out.println("Case #" + i + ": "
					+ getRecycledPairs(AB[0], AB[1]));
		}
	}
}