import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
package ch.googlecodejam.qualround;

import java.util.ArrayList;
import java.util.List;

public class RecycledNumbers {

    public static String solve(List<List<String>> values) {

        StringBuilder result = new StringBuilder();

        int numberOfLine = 1;
        for (List<String> line : values) {
            int minValue = Integer.parseInt(line.get(0));
            int maxValue = Integer.parseInt(line.get(1));

            int numberOfRecycledNumbers = getNumberOfRecycledNumbers(minValue,
                    maxValue);

            result.append("Case #" + numberOfLine + ": "
                    + numberOfRecycledNumbers + "\n");
            numberOfLine++;
        }

        return result.toString();
    }

    private static int getNumberOfRecycledNumbers(int minValue, int maxValue) {

        int numberOfRececlyedNumbers = 0;
        for (int numberToTest = minValue; numberToTest < maxValue; numberToTest++) {
            numberOfRececlyedNumbers += hasRecycledNumber(numberToTest,
                    maxValue);
        }
        return numberOfRececlyedNumbers;
    }

    private static int hasRecycledNumber(int number, int maxValue) {

        String originalNumber = String.valueOf(number);
        int numberOfRecycledNumber = 0;
        List<String> alreadyRecycled = new ArrayList<String>();

        for (int i = originalNumber.length() - 1; i > 0; i--) {
            String recycledNumber = getSwapedNumber(i, originalNumber);

            if (recycledNumber.charAt(0) != '0') {
                int valueRecycledNumber = Integer.parseInt(recycledNumber);
                if (valueRecycledNumber > number
                        && valueRecycledNumber <= maxValue && !alreadyRecycled.contains(recycledNumber)) {
                    numberOfRecycledNumber++;
                    alreadyRecycled.add(recycledNumber);
                } 
            }

        }

        return numberOfRecycledNumber;
    }

    public static String getSwapedNumber(int startIndex, String original) {

        StringBuilder swaped = new StringBuilder();
        swaped.append(original.substring(startIndex));
        swaped.append(original.substring(0, startIndex));
        return swaped.toString();
    }
}
