
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
package recyclednumbers;

import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author Masilo
 */
public class RecycledNumbers {

    public static void main(String[] args) {
        Scanner inputStream = null;
        PrintWriter outputStream = null;
      
        try{
            inputStream = new Scanner(new FileInputStream("input.txt"));
            outputStream = new PrintWriter(new FileOutputStream("output.txt"));
            
            int t = Integer.parseInt(inputStream.nextLine());
            String outputLine = "";
            String[] inputNumbers = null;
            int numberOfRecycledPair =0;
            int number =0, length =0;
            
            
            for (int i = 1; i<=t;i++){
                inputNumbers = inputStream.nextLine().split(" ");
                numberOfRecycledPair = 0;
                outputLine = "Case #"+i+": ";
                ArrayList<String> pairs = new ArrayList<String>();
                
                length = inputNumbers[0].length();
                if (length >1){
                    for (int n = Integer.parseInt(inputNumbers[0]);n<Integer.parseInt(inputNumbers[1]);n++){
                        for (int j = 1;j<length;j++){
                            number = Integer.parseInt(Integer.toString(n).substring(length-j)+Integer.toString(n).substring(0,length-j));
                            if (number>n && number<=Integer.parseInt(inputNumbers[1]))
                                if (!(pairs.contains(n+":"+number))){
                                    numberOfRecycledPair++;
                                    pairs.add(n+":"+number);
                                }
                        }
                    }
                }
                outputLine += ""+numberOfRecycledPair;
                outputStream.println(outputLine);
            }
            
            outputStream.close();
            inputStream.close();
            
        }
        catch(Exception e){
            System.out.println("file input.txt was not found");
        }
    }
}
