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

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

/**
 *
 * @author maheshgupta
 */
public class Recycled {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        try {
            HashMap hm = new HashMap();
            File file = new File("/Users/maheshgupta/Downloads/C-small-attempt0.in");
//            File file = new File("/Users/maheshgupta/Desktop/input.txt");
            BufferedReader in = new BufferedReader(new FileReader(file));
            FileWriter fw = new FileWriter("/Users/maheshgupta/Desktop/output.txt");
            String line;
            int cases = Integer.parseInt(in.readLine());

            for (int i = 0; i < cases; i++) {

                line = in.readLine();
                String[] lineArray = line.split(" ");
                int lower = Integer.parseInt(lineArray[0]);
                int upper = Integer.parseInt(lineArray[1]);
                int pair = 0;
                for (int j = lower; j <= upper; j++) {
                    String s = Integer.toString(j);

                    int length = s.length();
                    if (length == 1) {
                        continue;
                    } else {
                        for (int k = 0; k < length; k++) {
                            if (k + 1 < length) {

                                String newNumber = s.substring(k + 1, length) + s.substring(0, k + 1);
                                if (newNumber.charAt(0) != '0') {
                                    int number = Integer.parseInt(newNumber);
                                    if (number >= lower && number <= upper && number > j) {
                                        int value = hm.get(s + "#" + newNumber) != null ? (Integer) hm.get(s + "#" + newNumber) : 0;
                                        if (value != number) {
                                            hm.put(s + "#" + newNumber, number);
                                            pair++;
                                        }

                                    }
                                }




                            }

                        }
                    }
                }
                if (i < cases - 1) {
                    fw.write("Case #" + (i + 1) + ": " + pair + "\n");
                } else {
                    fw.write("Case #" + (i + 1) + ": " + pair);
                }

                hm.clear();

            }
            fw.close();
            in.close();
        } catch (IOException e) {
            System.out.println(e.toString());
        }
    }
}
