/*
 * 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 com.google.codejam;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;

public class ApplicationRecycledNumbers {
	
	public static final String fileName = "E:/Projects/RnD/GoogleCodeJam/src/com/google/codejam/google_data.txt";
	public static void main(String[] args) {
		try {
			BufferedReader bufferedReader = new BufferedReader(new FileReader(fileName));
			String text = bufferedReader.readLine();
			if (text != null) {
				RecycledNumbersCalculator recycledNumbersCalculator = new RecycledNumbersCalculator();
				recycledNumbersCalculator.processData(Integer.parseInt(text), bufferedReader);
			}
			
		} catch (FileNotFoundException e) {
			System.out.println("File not found.");
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}		
	}
}


class RecycledNumbersCalculator {
	
	public void processData(int parseInt, BufferedReader bufferedReader) {
		String lineData;
		for (int counter = 1; counter <= parseInt; counter++) {
			try {
				lineData = bufferedReader.readLine();
				String[] integers = lineData.split(" ");
				int smallNumber = Integer.parseInt(integers[0]);
				int largeNumber = Integer.parseInt(integers[1]);
				int noOfRecyledPairs = getNoOfDistinctRecycledPairs(smallNumber, largeNumber);
				System.out.println("Case #" + counter + ": " + noOfRecyledPairs);
			} catch (IOException e) {
				e.printStackTrace();
			}				
		}
	}
	
	private int getNoOfDistinctRecycledPairs(int smallNumber, int largeNumber) {
			int noOfRecyledPairs = 0; 
			List<Integer> numberUsed = new ArrayList<Integer>();
			
			for (int firstNumber = smallNumber; firstNumber <= largeNumber; firstNumber++) {
				String firstNumberStr = String.valueOf(firstNumber);
				
				for (int m = firstNumber+1; m <= largeNumber; m++) {
					
					String secondNumber = String.valueOf(m);
					int secondNumberLength = secondNumber.length();
					
					for (int p = 1; p <= secondNumberLength-1; p++) {
						
						String trailingChars = secondNumber.substring((secondNumberLength-p), secondNumberLength);
						String startingChars = secondNumber.substring(0, (secondNumberLength-p));
						String newNumber = trailingChars + startingChars;
						if (newNumber.equals(firstNumberStr)) {
							if (!numberUsed.contains(firstNumber) && !numberUsed.contains(secondNumber)) {
								noOfRecyledPairs++;
								break;
							}								
						}
						
						//System.out.println("trailingChars: " + trailingChars + ", startingChars: " + startingChars);
					}
				}				
			}
			
			return noOfRecyledPairs;
	}
}
