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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.LinkedList;

public class RecycledNumbers {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader reader = new BufferedReader(new FileReader(new File("C:\\Users\\GAUTAM\\Downloads\\GCJ2012Inputs\\C-small-attempt0.in")));
		int noOfInput = Integer.parseInt(reader.readLine());
			
		StringBuilder finalOutput = new StringBuilder();
		for(int i=1;i<=noOfInput;i++) {
			String input = reader.readLine();
			String[] range = input.split(" ");
			finalOutput.append("Case #"+i + ": " + result(Integer.parseInt(range[0]),Integer.parseInt(range[1]))+"\n");
		}
		reader.close();
		BufferedWriter writer = new BufferedWriter(new FileWriter(new File("C:\\Users\\GAUTAM\\Downloads\\GCJ2012Outputs\\C-small.out")));
		writer.write(finalOutput.toString());
		writer.close();
	}
	
	public static int result(int A, int B) {
		HashSet<String> result = new HashSet<String>();
		for(int i = A; i <= B;i++) {
			LinkedList<String> digits = digits(i);
			for(int k =0 ; k < digits.size()-1; k++) {
				int m = rightshift(digits,k);
				if(m >= A && m <= B && digits.size() == digits(m).size() && m != i) {
					if(!result.contains(String.valueOf(i) + "-" + String.valueOf(m)) && 
							!result.contains(String.valueOf(m) + "-" + String.valueOf(i))) {
						result.add(String.valueOf(i) + "-" + String.valueOf(m));
					}
				}				
			}
		}
		return result.size();
	}
	
	public static LinkedList<String> digits(int num) {
		LinkedList<String> digits = new LinkedList<String>();
		 while (num > 0 ){
			 int r = num % 10;
			 digits.addFirst(String.valueOf(r));
	         num = num / 10;
	     }
		 return digits;
	}
	
	public static int getNum(LinkedList<String> digits) {
		StringBuilder builder = new StringBuilder();
		for(String a : digits) {
			builder.append(a);
		}
		return Integer.parseInt(builder.toString());
	}

	public static int rightshift(LinkedList<String> digits,int noOfDig) {
		LinkedList<String> newList = new LinkedList<String>();
		int k = 0;
		for(int i = digits.size()-noOfDig-1; i < digits.size();i++ ) {
			newList.add(k, digits.get(i));
			k++;
		}
		for(int i = 0; i < digits.size()-noOfDig-1;i++ ) {
			newList.add(k, digits.get(i));
			k++;
		}
		return getNum(newList);
	}
}
