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

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.StringTokenizer;

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

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException {
        PrintStream out = new PrintStream(new FileOutputStream("output.txt"));
        System.setOut(out);
        parseAndTranslate();
    }

    private static void parseAndTranslate() {
        try {
            // Open the file that is the first 
            // command line parameter
            FileInputStream fstream = new FileInputStream("C-small-attempt2.in");
            // Get the object of DataInputStream
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            String strLine = br.readLine();
            if (null != strLine) {
                int count = new Integer(strLine);
                //Read File Line By Line
                int lineNo = 0;
                while ((strLine = br.readLine()) != null) {
                    lineNo++;
                    doOp(strLine, lineNo);
                }
                //Close the input stream
            }
            in.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }
    }

    private static void doOp(String strLine, int lineNo) {
        StringTokenizer st = new StringTokenizer(strLine);
        System.out.print("Case #" + lineNo + ": ");
        String no = st.nextElement().toString();
        Integer numberA = new Integer(no);

        no = st.nextElement().toString();
        Integer numberB = new Integer(no);
        Integer count = 0;
        for (Integer i = numberA; i < numberB - 1; i++) {
            for (Integer j = i + 1; j <= numberB; j++) {

                boolean isRecycled = isNumberRecycleable(i, j);
                if (isRecycled) {
                    count++;
                    //System.out.println("A: "+ i + " B:" + j);
                }
            }

        }
        System.out.println(count);
    }

    private static boolean isNumberRecycleable(Integer noA, Integer noB) {
        String tmp = noA.toString();
        char[] no1 = tmp.toCharArray();
        String tmp2 = noB.toString();
        char[] no2 = tmp2.toCharArray();
        //System.out.println("\n\nNo 1: " + tmp + " No 2: " + tmp2);
        if (no1.length != no2.length) {
            return false;
        } else {
            for (int i = 1; i < no1.length; i++) {
                //System.out.println("Diff: " + i);
                boolean isRecy = isRecycleable(no1, no2, i);
                if(isRecy){
                    return isRecy;
                }
            }
        }
        return false;
    }

    private static boolean isRecycleable(char[] no1, char[] no2, int add) {
            for (int j = 0; j < no2.length; j++) {                
                int k = (j + add) % no2.length;
                //System.out.println("Cmp: no1[" + j +"] = " + no1[j] + " & no2["+ k + "] = " + no2[k]);
                if(no1[j] != no2[k]){
                    return false;
                }
        }
        return true;
    }
}
