/*
 * 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.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

import dancers.DancerEvaluation;

public class RecycledNumberFinder {

    public int findNumbers(int startPoint, int endPoint) {

	List<Pair> lstOfRecycledPairs = new ArrayList<RecycledNumberFinder.Pair>();

	for (int i = startPoint; i < endPoint; i++) {

	    String numberToBeChecked = Integer.toString(i);

	    char[] number = numberToBeChecked.toCharArray();

	    for (int j = 1; j < number.length; j++) {
		char[] prepend = Arrays.copyOfRange(number, number.length - j, number.length);
		char[] append = Arrays.copyOfRange(number, 0, number.length - j);
		String recycledNumberAsString = (new String(prepend) + new String(append));
		int recycledNumber = Integer.parseInt(recycledNumberAsString);
		if( recycledNumber <= endPoint && recycledNumber > i){
 		    Pair p = new Pair(i, recycledNumber);
 		    if(!lstOfRecycledPairs.contains(p))
 			lstOfRecycledPairs.add(p);
		}

	    }



	}


	return lstOfRecycledPairs.size();

    }

    public class Pair{
	private final int x;
	private final int y;

	public int getX() {
	    return x;
	}

	public int getY() {
	    return y;
	}

	public Pair(int x, int y) {
	    this.x = x;
	    this.y = y;

	}

	@Override
	public boolean equals(Object obj) {
	    Pair objPair = (Pair) obj;
	    return getX() == objPair.getX() && getY() == objPair.getY();
	}

    }


    public static void main(String[] args) throws Exception{
	BufferedReader reader = new BufferedReader(new FileReader(new File("C:\\Users\\maheshsa\\Desktop\\input.txt")));
	int numOfTestCases = Integer.parseInt(reader.readLine());
	FileWriter fw = new FileWriter(new File("C:\\Users\\maheshsa\\Desktop\\output.txt"));
	for (int i = 1; i <= numOfTestCases; i++) {
	    String[] inputAsString = reader.readLine().split(" ");
	    int[] input = new int[inputAsString.length];
	    for (int j = 0; j < inputAsString.length; j++) {
		input[j] = Integer.parseInt(inputAsString[j]);
	    }
	    int startPoint = input[0];
	    int endPoint = input[1];
	    fw.append("Case #" + i + ": " + new RecycledNumberFinder().findNumbers(startPoint, endPoint) + "\n");
	}

	fw.flush();

	reader.close();
	fw.close();
    }


}
