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

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class C {
    private static abstract class Solver {
        public abstract String solveCase(String input);
    }

    public static void main(String[] args) throws IOException {
        solveTasks("C-small-attempt1", new Solver() {
            @Override
            public String solveCase(String input) {
                String[] parts = input.split(" ");
                int from = Integer.parseInt(parts[0]);
                int to = Integer.parseInt(parts[1]);
                int count = countRecycledBetween(from, to);
                return Integer.toString(count);
            }
        });
    }

    private static void solveTasks(String name, Solver bTest)
            throws FileNotFoundException, IOException {
        BufferedReader bufferedReader = new BufferedReader(new FileReader(name
                + ".in"));
        FileWriter outputWriter = new FileWriter(name + ".out");
        int inputLength = Integer.parseInt(bufferedReader.readLine());
        for (int i = 0; i < inputLength; i++) {
            String inputLine = bufferedReader.readLine();
            String output = bTest.solveCase(inputLine);
            String answer = "Case #" + (i + 1) + ": " + output;
            outputWriter.append(answer);
            outputWriter.append('\n');
            System.out.println(answer);
        }
        bufferedReader.close();
        outputWriter.close();
    }

    private static int countRecycledBetween(int a, int b) {
        int recycled = 0;
        for (int i = a; i < b; i++) {
            for (int j = i + 1; j <= b; j++) {
                if (isRecycled(i, j)) {
                    recycled++;
                }
            }
        }
        return recycled;
    }

    private static boolean isRecycled(int aInt, int bInt) {
        String aString = Integer.toString(aInt);
        String bString = Integer.toString(bInt);
        int lengthDiff = aString.length() - bString.length();
        if (lengthDiff > 0) {
            bString = appendZeroes(lengthDiff, bString);
        } else if (lengthDiff < 0) {
            aString = appendZeroes(-lengthDiff, aString);
        }
        for (int i = 1; i < aString.length(); i++) {
            String shifted = shiftString(bString, i);
            if (aString.equals(shifted)) {
                return true;
            }
        }
        return false;
    }

    private static String appendZeroes(int zeroes, String base) {
        StringBuilder stringBuilder = new StringBuilder();
        for (int i = 0; i < zeroes; i++) {
            stringBuilder.append('0');
        }
        stringBuilder.append(base);
        return stringBuilder.toString();
    }

    private static String shiftString(String input, int steps) {
        StringBuilder builder = new StringBuilder();
        builder.append(input.substring(steps));
        builder.append(input.substring(0, steps));
        return builder.toString();
    }

    private static int[] splitDigits(int number) {
        String string = Integer.toString(number);
        int[] digits = new int[string.length()];
        for (int i = 0; i < digits.length; i++) {
            digits[i] = string.charAt(i) - '0';
        }
        return digits;
    }
}
