/*
 * 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 y2012.quals;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;

public class C {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner in = new Scanner(new File("C.in"));
		PrintWriter out = new PrintWriter(new File("C.out"));
		int nTestCase = Integer.parseInt(in.nextLine());
		int[] stepeni = { 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000,
				100000000 };
		for (int testCase = 0; testCase < nTestCase; testCase++) {
			int a = in.nextInt();
			int b = in.nextInt();
			int res = a - 1;
			int brCif = 0;
			while (res > 0) {
				brCif++;
				res /= 10;
			}
			HashSet<Integer> hs = new HashSet<Integer>();
			for (int i = a; i <= b; i++) {
				if (i == stepeni[brCif])
					brCif++;
				int tmp = i;
				for (int j = 1; j < brCif; j++) {
					tmp = (tmp % 10) * stepeni[brCif - 1] + tmp / 10;
					if (i < tmp && tmp <= b && !hs.contains(tmp)) {
						res++;
						hs.add(tmp);
					}
				}
				hs.clear();
			}
			out.println("Case #" + (testCase + 1) + ": " + res);
		}
		in.close();
		out.close();
	}

}
