
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 br.com.app;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.util.Scanner;

public class RecycledNumbers {

    private static int totCasos, contCasos, contador, totNumerosMovidos, indice;
    private static long a, b, n, m;
    private static String numerosN, numerosM;
    private static StringBuilder temp = new StringBuilder();
    private static StringBuilder saida = new StringBuilder();
    private static File arquivoEntrada = new File("/home/emanuel/input.txt");
    private static File arquivoSaida = new File("/home/emanuel/output.txt");
    private static BufferedReader leitura;
    private static FileOutputStream fos;
    private static String linha;
    private static String[] entrada;

    public static void main(String[] args) {
        try {
            leitura = new BufferedReader(new FileReader(arquivoEntrada));
            linha = leitura.readLine();
            totCasos = Integer.parseInt(linha);
            for (int i = 0; i < totCasos; i++) {
                linha = leitura.readLine();
                entrada = linha.split(" ");
                a = Long.parseLong(entrada[0]);
                b = Long.parseLong(entrada[1]);
                for (n = a; n < b - 1; n++) {
                    for (m = n + 1; m <= b; m++) {
                        numerosN = String.valueOf(n);
                        numerosM = String.valueOf(m);
                        indice = numerosN.length() - 1;
                        totNumerosMovidos = 0;
                        while (totNumerosMovidos < numerosN.length()) {
                            temp.append(numerosN.substring(indice)).append(numerosN.substring(0, indice));
                            if (temp.toString().equals(String.valueOf(numerosM))) {
                                contador++;
                                break;
                            }
                            temp.delete(0, temp.length());
                            indice--;
                            totNumerosMovidos++;
                        }
                    }
                }
                contCasos++;
                saida.append("Case #").append(contCasos).append(": ").append(contador).append("\n");
                contador = 0;
            }
            fos = new FileOutputStream(arquivoSaida);
            fos.write(saida.toString().getBytes());
            fos.close();
        } catch (Exception e) {
            System.out.println(e.getMessage());
        }
    }
}
