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

import java.io.File;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 *
 * @author AHMED
 */
public class RecycledNumbers {
    public static void main(String[] args)throws Exception{
        RecycledNumbers r = new RecycledNumbers();
        //System.out.println(isRecycledPair(12345 , 51234));
        //System.out.println("0123456".substring(2,6));
        //414144414
        //441414441        
    }
    
    public RecycledNumbers() throws Exception{
        Scanner sc = new Scanner(new File("C-small-attempt0.in"));
        PrintWriter pin = new PrintWriter(new File("C-small-attempt0.out"));
        int T = Integer.parseInt(sc.nextLine());
        int A,B;
        int counter = 0;
        int x = 0;
        for(int testCaseIndex = 1 ; testCaseIndex <=T ; testCaseIndex++){
            A = sc.nextInt();
            B = sc.nextInt();
            //System.out.println(A+" "+B);
            for(int n = A ; n <= B ;n++){
                for(int m = (n+1) ; m<=B ;m++){
                    //pin.print(n+" "+m);
                    if(isRecycledPair(n,m))counter++;  
                }
            }
            pin.print("Case #"+testCaseIndex+": "+counter);
            if(testCaseIndex!=T)pin.print("\n");
            counter = 0;
        }
        pin.close();
        sc.close();
    }
    
    private static boolean isRecycledPair(int n, int m){
        if(n<10 && m<10)return false;//all digits < 10 cannto be recycled.
        
        String nString = Integer.toString(n);
        String mString = Integer.toString(m);
        int length = nString.length();
        int starting_mIndex = 0;
        String temp;
        
        for(int index = 0 ; index < length ; index++){
            for(starting_mIndex = 0 ; starting_mIndex < length ; starting_mIndex++){
                temp = mString.substring(starting_mIndex);
                temp+=mString.substring(0, starting_mIndex);
                if(temp.equals(nString))return true;
            }
        }
        
        return false;
        /*
        String nString = Integer.toString(n);
        String mString = Integer.toString(m);
        int length = mString.length();
        int nStringIndex;
        int mStrinIndex = mString.indexOf(nString.charAt(0)+"");//starting index
        
        //System.out.println(mStrinIndex);
        
        if(mStrinIndex == -1)return false;
        
        for(nStringIndex = 0 ; nStringIndex < length ; nStringIndex++){
            if(nString.charAt(nStringIndex)!=mString.charAt(mStrinIndex))return false;
            mStrinIndex = (mStrinIndex+1)%length;
        }
        
        return true;*/
    }
}
