/*
 * 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.io.BufferedReader;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;



public class RecycleNumbers {
	public static void main(String[] args) {
		try{
			BufferedReader fileIn = new BufferedReader(new FileReader("C-small-attempt0.in"));
			int cases = Integer.valueOf(fileIn.readLine());
			Scanner numReader = new Scanner(fileIn);
			for(int i = 0; i < cases; i++) {
				int start = numReader.nextInt();
				int end = numReader.nextInt();
				List<NumberQueue.Pair> p = new ArrayList<NumberQueue.Pair>();
				for(int n = start; n <= end; n++) {
					NumberQueue q = new NumberQueue(n);
					List<NumberQueue.Pair> returned = q.distinctRoations(start, end);
					for(NumberQueue.Pair ap : returned) {
						if(!p.contains(ap)) {
							p.add(ap);
						}
					}
				}
				System.out.println("Case #"+(i+1)+": "+p.size());
			}
		} catch(Exception err) {
			System.out.println("ERRORRRRRRRRRRRRRRRRRRRRR: "+ err.getMessage());
			err.printStackTrace();
		}
	}
}
