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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class ProblemCRecycledNumbers {

	@SuppressWarnings("unchecked")
	public ProblemCRecycledNumbers() {
		try {
			FileReader fr = new FileReader("C-small-attempt0.in");
			BufferedReader br = new BufferedReader(fr);
			
			FileWriter fw = new FileWriter("C-small-attempt0.out");
			BufferedWriter bw = new BufferedWriter(fw);
			
			int numCases = Integer.parseInt(br.readLine());
			int caseNum = 1;
			
			String line = br.readLine();
			while (line != null) {
				System.out.println(line);
				
				String[] nums = line.split(" ");
				int lowNum = Integer.parseInt(nums[0]);
				int highNum = Integer.parseInt(nums[1]);
				
				Set<Pair> possibles = new HashSet<Pair>();
				for (int num = lowNum; num<= highNum; num++) {
					Pair[] recycled = getRecycledNumbers(num);
					for (int i=0; i<recycled.length; i++) {
						if (recycled[i] != null && recycled[i].int1 >= lowNum) {
							possibles.add(recycled[i]);
						}
					}
				}
				
				System.out.println(possibles);
				
				String output = "Case #"+ caseNum;
				output += ": "+possibles.size();
				
				System.out.println(output);
				bw.append(output);
				if (caseNum != numCases)
					bw.newLine();
				
				caseNum++;
				line = br.readLine();
			}
			
			bw.flush();
			bw.close();
			br.close();
			
		} catch(Exception e) {
			e.printStackTrace();
		}
	}
	
	public void printArr(Pair[] arr) {
		System.out.print("[");
		for(int i=0; i<arr.length; i++) {
			System.out.print(arr[i]+",");
		}
		System.out.println("]");
	}
	
	public Pair[] getRecycledNumbers(int num) {
		String numSt = num + "";
		Pair[] recycled = new Pair[numSt.length() - 1];
		
		for(int i=0; i<recycled.length; i++) {
			String newNumSt = numSt.substring(i + 1) + numSt.substring(0, i+1);
			int newNum = Integer.parseInt(newNumSt);

			if (! newNumSt.substring(0,1).equals("0") && newNum < num) {
				//no leading 0's
				recycled[i] = new Pair(newNum, num);
			} else {
				recycled[i] = null;
			}
		}
		
		return recycled;
	}
	
	public static void main(String[] args) {
		new ProblemCRecycledNumbers();
	}
	
	class Pair implements Comparable<Pair>{
		int int1, int2;
		
		public Pair(int int1, int int2) {
			this.int1 = int1;
			this.int2 = int2;
		}
		
		public boolean equals(Pair p) {
			return 
					(p.int1 == this.int1 && p.int2 == this.int2) ||
					(p.int2 == this.int1 && p.int1 == this.int2);
		}
		
		public boolean equals(Object p) {
			return this.equals((Pair) p);
		}
		
		public int hashCode() {
			return this.int1 * 10000000 + int2;
		}
		
		public String toString() { return "("+int1+","+int2+")"; }

		public int compareTo(Pair p) {
			return this.int1 - p.int1;
		}
	}

}
