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

 


import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;

public class RecycledNumbers {

    public static void main(String[] args) {
      
        int result= 0 ,x,y,counter,num,count;

        String SoX,temp;

       int[] array = new int[7];
 
       int cntarray=0;

       boolean flag = true;

       PrintWriter pw = null;
 
      Scanner sc = null;
  
      try {
   
             sc = new Scanner(new FileReader("C:\\Users\\gad\\Downloads\\C-small-attempt0.in"));
 
             pw = new PrintWriter(new FileWriter("D:\\mystudy\\RCoutput.out"));

             int  cc=Integer.parseInt(sc.nextLine());
   
             for(int cnt=0;cnt<cc;cnt++)

                {
                   
                   x=sc.nextInt();

                   y=sc.nextInt();
                     for(int j=x;j<=y;j++){

                             SoX=String.valueOf(j);
 
                             counter=SoX.length();
                             count=counter;

                             array[cntarray]=j;

                             cntarray++;

                             temp=SoX;
 
                       while(count>1)

                        {

                           temp =  temp.substring(1,counter) + temp.charAt(0);

                            num = Integer.parseInt(temp);

                            for (int t=0;t<cntarray;t++)

                                if(num==array[t])
  
                                    {
   
                                      flag=false;
 
                                      break;
 
                                    }

                               if(flag==true)
  
                                   {
      
                                      array[cntarray]=num;
                   
                                      cntarray++;
  
                                  }
    
                               if(num<=y&&num>=x&&j<num&&flag)
 
                                 {
                                  result++;
  
                                }
      
                      count--;
   
                      flag=true;
   
                     }
   
                     cntarray=0;
  
                      flag=true;
    
                }
        
            pw.println("Case #"+(cnt+1)+": "+result);
    
            result=0;
  
            cntarray=0;
   
             }
     
   } 
catch (IOException ex) {

            Logger.getLogger(RecycledNumbers.class.getName()).log(Level.SEVERE, null, ex);

        } finally {

            pw.flush();

            pw.close();
         
   sc.close();

        }
    }

          }
          


