/*
 * 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.BufferedWriter;
import java.io.DataInputStream;
import java.io.DataOutputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.LinkedList;

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

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        
        try {
            FileInputStream fstream = new FileInputStream(args[0]);
            
            // Get the object of DataInputStream
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            
            /*FileOutputStream ostream = new FileOutputStream(args[1]);
            DataOutputStream out = new DataOutputStream(ostream);
            BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(out));*/
        
            int testcases = Integer.parseInt(br.readLine());
            
            for (int i =0; i < testcases; i++) {
                String line = br.readLine();
                int a = Integer.parseInt(line.substring(0, line.indexOf(" ")));
                int b = Integer.parseInt(line.substring(line.indexOf(" ") + 1));
                
                int length = line.indexOf(" ");
                
                //System.out.println(line + " = " + a + " " + b + ", Length: " + length);
                
                LinkedList[] pairs = new LinkedList[b];
                for (int k = 0; k < b; k++) {
                    pairs[k] = new LinkedList();
                }
                
                //for each number in range
                for (int m = a; m < b; m++) {
                    
                    //for each substring in current number
                    for (int cut = 1; cut < length ; cut++) {
                        //rotate
                        String mstring = Integer.toString(m);
                        int n = Integer.parseInt(mstring.substring(cut) + mstring.substring(0, cut));
                        
                        //store values in list if not already present
                        if (!pairs[m].contains(n) && m < n && n < b+1 && n > a){
                            pairs[m].add(n);
                            //System.out.println(m + " + " + n);
                        }
                    }
                  
                }
                
                int recycledpairs = 0;
                for (int k = 0; k < b; k++) {
                    recycledpairs += pairs[k].size();
                }
                
                // save values
                System.out.println( "Case #" + (i+1) + ": " + recycledpairs);
                //bw.write("Case #" + "i" + ": " + recycledpairs);
                //bw.newLine();
                
               
            }
            
            in.close();
            //out.close();
            
        } catch (Exception e) {
            
            //Catch exception if any
            System.err.println("Error: " + e.getMessage());
            e.printStackTrace();
        }
        
        
    }
}
