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

import java.io.File;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.concurrent.TimeUnit;

public class RecycledNumbers {

	private boolean[] data;
	private int min;
	private int max;
	private int digits;
	private int mask;

	public RecycledNumbers(int min, int max) {
		this.min = min;
		this.max = max;
		digits = (int) Math.ceil(Math.log10(max));
		mask = (int) Math.pow(10, digits);
		initData();
	}

	private void initData() {
		data = new boolean[max - min + 1];
	}

	public int eval() {
		int[] result = new int[digits];
		int total = 0;
		for (int number = min; number <= max; number++) {
			if (!isTested(number)) {
				int n = getRecycleNumbers(number, result);
				int real_n = setTested(result, n);
				if (real_n > 1) {
					total += real_n * (real_n - 1) / 2;
				}
			}
		}
		return total;
	}

	private int setTested(int[] result, int n) {
		int tested = 0;
		for (int i = 0; i < n; i++) {
			if (!data[result[i] - min]) {
				data[result[i] - min] = true;
				tested++;
			}
		}
		return tested;
	}

	private int getRecycleNumbers(int number, int[] result) {
		int count = 0;
		for (int i = 0; i < digits; i++) {
			if (number >= min && number <= max) {
				result[count++] = number;
			}
			int number10 = number * 10;
			number = (number10 % mask) + (number10 / mask);
		}
		return count;
	}

	private boolean isTested(int number) {
		return data[number - min];
	}

	public static void main(String[] args) throws Exception {
		PrintWriter output = new PrintWriter("output3.txt");
		Scanner scanner = new Scanner(new File("input3.txt"));
		try {
			int input_T = scanner.nextInt();
			for (int i = 0; i < input_T; i++) {
				int input_A = scanner.nextInt();
				int input_B = scanner.nextInt();
				RecycledNumbers testing = new RecycledNumbers(input_A, input_B);
				long start = System.nanoTime();
				int eval = testing.eval();
				output.printf("Case #%d: %d\n", i + 1, eval);
				System.out
						.printf("Case #%d: %d (%d)\n",
								i + 1,
								eval,
								TimeUnit.NANOSECONDS.toMillis(System.nanoTime()
										- start));
			}
		} finally {
			output.close();
			scanner.close();
		}
	}

}
