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

import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.util.BitSet;
import java.util.Scanner;

public class RecycledNumbers {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(new FileInputStream("/home/meha/eclipse-android-workspace/Code Jam/Testcase/RecycledNumbers/C-small-attempt0.in"));
		
		FileWriter out = new FileWriter("/home/meha/eclipse-android-workspace/Code Jam/Testcase/RecycledNumbers/A-small.out");
		
		int T = in.nextInt();
		for(int i = 0; i < T; i++)
		{
			int A = in.nextInt();
			int B = in.nextInt();
			int count = 0;
			
			//for(int n=A, m=B; n < m; n++,m--)
			for(int n=A; n < B; n++)	
			{
				for(int m=B; n < m; m--)
				{
					if(areRecycled(n,m))
						count++;
				}
			}
			
			int tmp = i + 1;
			out.write("Case #" + tmp + ": " + count + "\n");
			System.out.print("Case #" + tmp + ": " + count + "\n");
		}
		out.close();
		//System.out.print(areRecycled(12345, 34512));
	}

	private static boolean areRecycled(int N, int M) {
		// TODO Auto-generated method stub
		String n = Integer.toString(N);
		String m = Integer.toString(M);
		
		if(n.length() != m.length())
			return false;
		
		BitSet sChar = new BitSet(m.length());
		for(int i = 0; i < m.length(); i++)
		{
			if(m.charAt(i) == n.charAt(0))
			{
				sChar.set(i);
			}
		}
		
		
		for(int i = sChar.nextSetBit(0); i >=0; i = sChar.nextSetBit(i+1))
		{
			String mstart = m.substring(0, i);
			String mend = m.substring(i, m.length());
			String nstart =  n.substring(0, n.length() - i);
			String nend = n.substring(n.length() - i, n.length());
			
			if(nstart.equalsIgnoreCase(mend) && nend.equalsIgnoreCase(mstart))
			{
				return true;
			}
		}
		
		return false;
	}

}
