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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class RecycledNumbers {
	public static void main(String[] args) {
		try {
			// lets get the data in
			FileInputStream fstream = new FileInputStream("E:/workspace_java/CodeJam12/src/RecycledNumbers/input.in");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			
			// open file for writing
			FileWriter fwstream = new FileWriter("E:/workspace_java/CodeJam12/src/RecycledNumbers/output.out");
			BufferedWriter out = new BufferedWriter(fwstream);
			
			// declare variables
			int i,j,k;
			int numCases;
			String[] strArr;
			
			// get number of cases
			strLine = br.readLine();
			numCases = Integer.parseInt(strLine);
			
			// declare specific vars
			int low, high, n;
			int cur, len;
			int count;
			String ts, ns, a, b;
			ArrayList<String> found = new ArrayList<String>();
			
			// loop through cases
			for(i=0;i<numCases;i++){
				// read case
				strLine = br.readLine();
				strArr = strLine.split(" ");
				
				count = 0;
				
				low = Integer.parseInt(strArr[0]);
				high = Integer.parseInt(strArr[1]);
				
				for(j = low; j <= high; j++){
					cur = j;
					ts = new Integer(cur).toString();
					len = ts.length();
					//System.out.print(ts + " => ");
					for(k = len - 1; k >= 0; k--){
						a = ts.substring(k);
						b = ts.substring(0, k);
						n = Integer.parseInt(a + b);
						ns = new Integer(n).toString();
						if(n >= low && n <= high && n > cur && !(in_array(ns+ts, found))){
							count++;
							//System.out.print(ns + " ");
						}
					}
					//System.out.println();
				}
				
				
				/* final tests	
					if((one >= 0 && one <= 10) && (two >= 0 && two <= 10) && (three >= 0 && three <= 10)) { }
					else { System.out.println("Out of bounds on number"); }
					
					if(total != tempScore) { System.out.println("Score does not add up"); }
					
					if(surprisesTaken > numSurprises) { System.out.println("Too many surprises"); }
					*/
				
					
					
					//System.out.println(one + " " + two + " " + three);
				System.out.print("Case #"+(i+1)+": ");
				out.write("Case #"+(i+1)+": ");
				System.out.println(count);
				out.write(Integer.toString(count));
				out.newLine();
			}
			
			
			//System.out.print("Case #"+(i+1)+": ");
			//out.write("Case #"+(i+1)+": ");
			//System.out.println(seanP2sum);
			//out.write(Integer.toString(seanP2sum));
			//out.newLine();
			
			
			out.close();
			in.close();
			
		} catch (Exception e) {
			System.err.println("Error: " + e.getMessage());
		}

	}
	
	public static boolean in_array(String needle, ArrayList<String> haystack){
		boolean found = false;
		int i = 0;
		int len = haystack.size();
		
		for(i=0; i<len; i++){
			if(needle.equals(haystack.get(i))){
				found = true;
				System.out.println("found match of "+needle + " matching " + haystack.get(i) + " at index " + i);
			}
			
		}
		
		return found;
	}
}
