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

import java.io.*;
import java.lang.Math.*;
import java.util.Arrays;

public class C {

	public static void main(String[] args) {

		try {
			BufferedReader input = new BufferedReader(new FileReader("C:/CodeJam/C-small-attempt0.in"));
			BufferedWriter output = new BufferedWriter(new FileWriter("C:/CodeJam/C-small-attempt0.out"));
			try {
				int T = Integer.parseInt(input.readLine());

				//Process each case
				for (int i = 0; i < T; i++) {
					String line = input.readLine();
					String[] AB = line.split(" ");
					int A = Integer.parseInt(AB[0]);
					int B = Integer.parseInt(AB[1]);
					String max = String.valueOf(B);
					
					//Check every n,m pair for cur case
					int count = 0;
					for (int j = A; j < B; j++) {
						String n = String.valueOf(j);
						String m = n;
						int len = m.length();
						//For single digit numbers, no matches possible
						if (len == 1) {
							break;
						}
						//Check each possible match for current n
						int[] matches = new int[len];
						int subcount = 0;
						for (int k = 0; k < len; k++) {
							//Check current permutation of m for valid range
							if (m.compareTo(n) > 0 && m.compareTo(max) <= 0) {
								matches[subcount] = Integer.parseInt(m);
								subcount++;
							}
							//Move the last digit to the front
							m = m.substring(len - 1, len) + m.substring(0, len - 1);
						}
						//Check the matches for duplicates and uncount them
						Arrays.sort(matches);
						for (int k = 0; k < len - 1; k++) {
							if(matches[k] != 0 && matches[k+1] != 0 && matches[k] == matches[k+1]) {
								subcount--;
							}
						}
						count += subcount;
					}

					System.out.println("Case #" + (i + 1) + ": " + count);
					output.write("Case #" + (i + 1) + ": " + count + "\n");
				}
			} finally {
				input.close();
				output.close();
			}
		} catch (IOException ex) {
			ex.printStackTrace();
		}
	}
}
