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

import java.io.BufferedReader;
import java.io.FileReader;
import java.util.Arrays;

public class Recycled 
{
	static int[] arr = new int[10];
	
	static int rot(int x, int N, int mult) {
		return x/10 + (x%10)*mult;
	}
	
	static int count(int j, int B, int N, int mult) {
		int cnt = 0;
		int tmp = rot(j,N,mult);
		while (tmp != j) {
			if (tmp > j && tmp <= B) {
				arr[cnt] = tmp;
				++cnt;
			}
			tmp = rot(tmp,N,mult);
		}
		Arrays.sort(arr,0,cnt);
		int ret = 0;
		for (int i = 0; i < cnt; ++i)
		{
			if (i == 0 || arr[i] != arr[i-1]) {
				//System.out.println(j+","+arr[i]);
				++ret;
			}
		}
		return ret;
	}
	
	public static void main(String[] args) throws Exception {
		BufferedReader in = new BufferedReader(new FileReader(args[0]));
		String line = in.readLine();
		int X = Integer.parseInt(line);
		for (int i = 0; i < X; ++i) {
			long ret = 0;
			line = in.readLine();
			String[] toks = line.split(" ");
			int A = Integer.parseInt(toks[0]), B = Integer.parseInt(toks[1]);
			int N = (A+"").length();
			int mult = (int)Math.round(Math.pow(10, N-1));
			//System.out.println("Doing "+A+","+B+" with mult = "+mult);
			for (int j = A; j < B; ++j) {
				ret += count(j,B,N,mult);
			}
			System.out.println("Case #"+(i+1)+": "+ret);
		}
	}
}
