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

package year_2012.qualification;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;

/**
 *
 * @author paul
 * @date 14 Apr 2012
 */
public class QuestionC {

    private static Set<Integer> getCycle(int x) {

        String s = Integer.toString(x);
        Set<Integer> set = new HashSet<Integer>();
        set.add(x);
        for (int c = 1; c < s.length(); c++) {
            String t = s.substring(c).concat(s.substring(0, c));
            set.add(Integer.parseInt(t));
        }
        return set;
        
    }

    private static Set<Integer> mask(Set<Integer> set, int a, int b) {
        Set<Integer> result = new HashSet<Integer>();

        for (int x : set) {
            if (x >= a && x <= b) {
                result.add(x);
            }
        }
        
        return result;

    }


    public static void main(String[] args) throws FileNotFoundException, IOException {

        String question = "C";

//        String name = "large";
        String name = "small-attempt0";
//        String name = "test";

        String filename = String.format("%s-%s", question, name);

        BufferedReader input = new BufferedReader(
                new FileReader(String.format("/home/paul/Documents/code-jam/2012/qualification/%s.in",
                filename)));

        String firstLine = input.readLine();

        PrintWriter pw = new PrintWriter(new File(
                String.format("/home/paul/Documents/code-jam/2012/qualification/%s.out", filename)));


        int T = Integer.parseInt(firstLine);

        // Loop through test cases.
        for (int i = 0; i < T; i++) {

//             Read data.
            String[] tokens = input.readLine().split(" ");

//            int N = Integer.parseInt(input.readLine());

            int A = Integer.parseInt(tokens[0]);
            int B = Integer.parseInt(tokens[1]);

//            System.out.format("%d, %d\n", A, B);

            boolean[] used = new boolean[B+1];
            int total = 0;
            for (int n = A; n <= B; n++) {
                if (!used[n]) {
                    Set<Integer> set = mask(getCycle(n), A, B);
                    int k = set.size();
                    total += (k * (k-1))/2;
                    for (int m : set) {
                        used[m] = true;
                    }
                }
            }

            pw.format("Case #%d: %d\n", i + 1, total);
        }

        pw.close();

    }

}

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

import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;

/**
 *
 * @author Aymen
 */
public class main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws IOException {

        int[] v = new int[1000];
        String outputFile = System.getenv("USERPROFILE") + "\\Documents\\C-small.out";
        String inputFile = System.getenv("USERPROFILE") + "\\Documents\\C-small.in";
        //String outputFile = System.getenv("USERPROFILE") + "\\Documents\\output.txt";
        //String inputFile = System.getenv("USERPROFILE") + "\\Documents\\input.txt";

        BufferedWriter os = new BufferedWriter(new FileWriter(outputFile));
        DataInputStream is = new DataInputStream(new FileInputStream(inputFile));

        int T = Integer.valueOf(is.readLine());

        System.out.println("T " + T);

        for (int i = 0; i < T; i++) {
            String list = is.readLine();
            list += " ";
            int l = list.substring(0, list.indexOf(" ")).length();
            int A = Integer.valueOf(list.substring(0, list.indexOf(" ")));
            list = list.substring(list.indexOf(" ") + 1);
            int B = Integer.valueOf(list.substring(0, list.indexOf(" ")));
            list = list.substring(list.indexOf(" ") + 1);

            boolean exist = false;
            int num, result = 0;
            String numString, numRotate;
            v[0] = 0;
            for (int j = A; j <= B; j++) {
                num = j;
                for (int n = 0; n < result; n++) {
                    if (num == v[n]) {                                                
                    }
                }
                numString = String.valueOf(num);
                numRotate = numString;
                numRotate = numRotate.substring(l - 1) + numRotate.substring(0, l - 1);
                num = Integer.valueOf(numRotate);
                while (numRotate.substring(0, 1).equals("0")) {
                    numRotate = numRotate.substring(l - 1) + numRotate.substring(0, l - 1);
                }
                num = Integer.valueOf(numRotate);
                while ((num < A) || (num > B)) {
                    numRotate = numRotate.substring(l - 1) + numRotate.substring(0, l - 1);
                    num = Integer.valueOf(numRotate);
                }

                while (num != j) {
                    if ((!exist) && (num != j)) {
                        for (int m = j + 1; m <= B; m++) {                            
                            if (m == num) {
                                v[result] = m;
                                result++;
                            }
                        }
                    }                    
                    numRotate = numRotate.substring(l - 1) + numRotate.substring(0, l - 1);
                    num = Integer.valueOf(numRotate);
                    while (numRotate.substring(0, 1).equals("0")) {
                        numRotate = numRotate.substring(l - 1) + numRotate.substring(0, l - 1);
                    }
                    num = Integer.valueOf(numRotate);
                    while ((num < A) || (num > B)) {
                        numRotate = numRotate.substring(l - 1) + numRotate.substring(0, l - 1);
                        num = Integer.valueOf(numRotate);
                    }
                    
                }
            }

            int m = i + 1;
            os.write("Case #" + m + ": " + result);
            os.newLine();
        }
        is.close();
        os.close();
    }
}
