/*
 * 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 google.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

import java.util.Set;
import java.util.TreeSet;

public class Problem3 {
    public Problem3() {
        super();
    }
    public static void main(String[] args) {
        try {
        BufferedReader reader = new BufferedReader(new FileReader("D:\\codejam\\2012\\C.in"));
        BufferedWriter writer = new BufferedWriter(new FileWriter("D:\\codejam\\2012\\C.out"));

                //... Loop as long as there are input lines.
                String line = null;
            reader.readLine();
            int i=1;
                while ((line=reader.readLine()) != null) {
                    writer.write("Case #"+i+": "+convert(line));
                    writer.newLine();   // Write system dependent end of line.
                    i++;
                }

                //... Close reader and writer.
                reader.close();  // Close to unlock.
                writer.close();  // Close to unlock and flush to disk.

    }
        catch(Exception ex) {
            ex.printStackTrace();
        }
    }
    

//public static void main(String[] args) {
//        System.out.println(convert("123 995"));
//    }
    private static boolean isInRange(String num,int A, int B) {
        
            int iNum = Integer.parseInt(num);
            if(iNum>=A && iNum<=B)
                return true;
        return false;
    }
    
    private static Set<String> cycle(String num, int A,int B) {
        Set<String> cycleSet = new TreeSet<String>();
        
        if(isInRange(num,A,B))
            cycleSet.add(num);
        
        for(int i=1;i<num.length();i++) {
            String tmp = num.substring(num.length()-i)+num.substring(0, num.length()-i);
            if(isInRange(tmp, A, B))
                cycleSet.add(tmp);
        }
       // System.out.println(cycleSet);
        return cycleSet;
    }
    
    private static int size(Set<String> set) {
        int size = set.size();
        return (size*(size-1))/2;
    }
    private static int convert(String input) {
        String[] inputArr = input.split(" ");
        
        try {
            int A = Integer.parseInt(inputArr[0]);
            int B = Integer.parseInt(inputArr[1]);
            
            Set<String> processedNumber = new TreeSet<String>();
            
            Set<String> childSet = null;
            int size=0;
            
            int totalCount = 0;
            for(Integer num = A;num<=B;num++) {
                
                if(processedNumber.contains(num.toString()))
                    continue;
                
                childSet = cycle(num.toString(), A, B);
                size = size(childSet);
                
                if(size>0) {
                    totalCount+=size;
                    processedNumber.addAll(childSet);
                }
                
            }
            
            return totalCount;
            
        }
        catch(Exception ex) {
            ex.printStackTrace();
        }
        return 0;
    }
}
