/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package gcj;

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


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());
        }
    }
}
