/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package recyclednumbers;

/**
 *
 * @author vandit
 *//*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.lang.String;
import java.util.HashSet;
import java.util.StringTokenizer;

/**
 *
 * @author vandit
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        String filePathIn = args[0];
        String filePathOut = args[1];
        //String filePathIn = "/home/vandit/Desktop/GoogleCodeJam/Qualifying round/testinput.in";
        //String filePathOut = "/home/vandit/Desktop/GoogleCodeJam/Qualifying round/testOutput.out";
        FileReader fr = null;
        BufferedReader inputFileReader = null;
        FileWriter fw = null;
        BufferedWriter outputFileWriter = null;
        try {
            fr = new FileReader(filePathIn);
            inputFileReader = new BufferedReader(fr);

            fw = new FileWriter(filePathOut);
            outputFileWriter = new BufferedWriter(fw);


            int numberOfTestCases = Integer.parseInt(inputFileReader.readLine());

            for (int i = 0; i < numberOfTestCases; i++) {
                String inputContent = inputFileReader.readLine();
                
                StringTokenizer tokenizer = new StringTokenizer(inputContent);
                int startingNumber = Integer.parseInt(tokenizer.nextToken());
                int endingNumber = Integer.parseInt(tokenizer.nextToken());

                HashSet<Pair> numbers =  new RecycleNumbers().findAllRecycledNumbers(startingNumber,endingNumber);
                
                String outputContent = Integer.toString(numbers.size());
                //String outputContent =
                String output = "Case #" + (i+1) + ": " + outputContent+"\n";
                outputFileWriter.write(output);

            }
        outputFileWriter.flush();

        } catch (Exception ex) {
            ex.printStackTrace();

        } finally {
            try {
                outputFileWriter.close();
                inputFileReader.close();
                fr.close();
                fw.close();
            } catch (Exception ex) {
                ex.printStackTrace();
            }
        }
    }
}

