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

import java.awt.Point;
import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;


public class RecycledNumbers {

	
	public static void main(String[] args) throws FileNotFoundException, IOException {
		int t = 0;
		FileInputStream fstream = new FileInputStream(new File(args[0]));
		DataInputStream in = new DataInputStream(fstream);
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		String line = br.readLine();
		t = Integer.parseInt(line);
		System.out.println(t);
		String output;
		FileWriter fw = new FileWriter(new File("C-small-attempt0.out"));
		HashSet<Point> points = new HashSet<Point>();
		
		for(int i = 0; i < t; i++) {
			int counter = 0;
			line = br.readLine();
			
			String[] parameters = line.split(" ");
			int a = Integer.parseInt(parameters[0]);
			System.out.println("a: " + a);
			int number = a;
			int possibleRecycled = 0;
			int b = Integer.parseInt(parameters[1]);
			System.out.println("b: " + b);
			int numberOfDigits = 1;
			while(a/(int)Math.pow(10, numberOfDigits) != 0){
				numberOfDigits++;
			}
		
			while(number <= b){
				int[] digits = new int[numberOfDigits - 1];
				int holder = number;
				int j = 0;
				while (j < numberOfDigits - 1){
					digits[j] = holder % 10;
					holder = holder / 10;
					j++;
				}
				boolean next = true;
				for(int k = 0; k < digits.length && next ; k++){
					if(digits[k] * Math.pow(10, numberOfDigits - 1) < b){
						next = false;
					}
				}
				if(!next){
					int digitStep = 1;
					int lastDigit = 0;
					possibleRecycled = number;
					while(digitStep < numberOfDigits){
						lastDigit = possibleRecycled % 10;
						possibleRecycled = (int) (lastDigit * Math.pow(10, numberOfDigits - 1) + ( possibleRecycled / 10));
						if(possibleRecycled > number && possibleRecycled <= b && !points.contains(new Point(number,possibleRecycled))){
							points.add(new Point(number,possibleRecycled));
							counter++;
//							System.out.println(number + "   " + possibleRecycled );
						}
						digitStep++;
					}
				}
				number++;
			}
			
			output = "Case #" + (i + 1) + ": " + counter + "\n";		
			fw.write(output);
			points.clear();
		}
		fw.flush();
		fw.close();
	}

}
