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

import java.io.*;

/**
 *
 * @author Peter
 */
public class RecycledNumbers {

    /**
     * @param args the command line arguments
     */
   
    public static void main(String[] args) {
        String inputFile, outputFile;
        inputFile = "C-small-attempt4.in"; //"C-small-attempt1.in";// "input.txt";
        outputFile = "output.txt";
        File file = new File(inputFile);
        FileInputStream fis = null;
        BufferedInputStream bis = null;
        DataInputStream dis = null;

        try {
            fis = new FileInputStream(file);
            // Here BufferedInputStream is added for fast reading.
            bis = new BufferedInputStream(fis);
            dis = new DataInputStream(bis);

            FileWriter fstream = new FileWriter(outputFile);
            BufferedWriter out = new BufferedWriter(fstream);

            String line, output;
            line = dis.readLine();
            int testCases = Integer.parseInt(line);
            int A, B, m, n, caseNo = 1, count = 0;
            String[] param;
            // dis.available() returns 0 if the file does not have more lines.
            while (dis.available() != 0) {
                output = "Case #" + caseNo + ": ";
                line = dis.readLine();
                param = line.split(" ");
                A = Integer.parseInt(param[0]);
                B = Integer.parseInt(param[1]);
                for(m = B; m > A; m--){
                    for(n = m - 1; n >= A; n--){
                        if(isRecycled(n + "", m + "")){
                            count++;
                           //System.out.println("n =" + n + " m =" + m + " count =" + count);
                        }
                    }
                }
                output += count;
                count = 0;
                out.append(output + "\n");
                caseNo++;
            }

            // dispose all the resources after using them.
            fis.close();
            bis.close();
            dis.close();
            out.close();

        } catch (FileNotFoundException e) {
            e.printStackTrace();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }
    
    public static boolean isRecycled(String n, String m){
        boolean recycled = false;
        
        if(n.length() != m.length()){
            return recycled;
        }
        
        for(int i = 0;i< n.length() ; i++){
            if(n.equals(m)){
                recycled = true;
                break;
            }else{
                n = n.charAt(n.length() - 1) + n.substring(0, n.length() - 1);
                if(n.equals(m)){
                recycled = true;
                break;
                }
            }
        }
        return recycled;
    }
}
