/*
 * 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();

    }

}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.logging.Level;
import java.util.logging.Logger;

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

    public static void main(String[] args) {

        BufferedReader bf = null;
        BufferedWriter bw = null;
        try {
            bf = new BufferedReader(new FileReader("./C-small-attempt0.in"));
            bw =new BufferedWriter(new FileWriter("./C-small-attempt0.out"));
           int prt=Integer.parseInt(bf.readLine());
           
           for(int printer=0;printer<prt;printer++){

            String str[] = bf.readLine().split(" ");

            int first = Integer.parseInt(str[0]);
            int second = Integer.parseInt(str[1]);
            int count = 0;
            String mystr = "" + first;
            int mystr_length = mystr.length();
            int myarr[][] = new int[(second - first) + 1][mystr_length];

            for (int i = first, m = 0; i <= second; i++, m++) {

                int mytemparr[] = new int[mystr_length];
                mytemparr[0] = i;

                for (int j = 1; j < mystr_length; j++) {

                    String newstr = "" + mytemparr[j - 1];
                    while (newstr.length() != mystr_length) {
                        newstr = "0" + newstr;
                    }
                    newstr = newstr.charAt(newstr.length() - 1) + newstr.substring(0, newstr.length() - 1);
                    mytemparr[j] = Integer.parseInt(newstr);

                }
                Arrays.sort(mytemparr);

                myarr[m] = mytemparr;

            }

            for (int m = 0; m < myarr.length; m++) {
                for (int j = m + 1; j < myarr.length; j++) {
                    if (myarr[m][0] == myarr[j][0]) {
                        myarr[m][0] = -1;

                    }
                }
            }

            for (int m = 0; m < myarr.length; m++) {
                if (myarr[m][0] != -1) {
                    for (int ind = 0; ind < mystr_length-1 ; ind++) {
                        for (int ind2 = ind + 1; ind2 < mystr_length; ind2++) {
                            if (myarr[m][ind] == myarr[m][ind2]) {
                                myarr[m][ind2] = -1;

                            }
                        }
                    }
                }
            }

            if (mystr_length > 1) {

                for (int m = 0; m < myarr.length; m++) {
                    for (int j = 0; j < mystr_length; j++) {
                        if (myarr[m][0] != -1) {

                            for (int z = j + 1; z < mystr_length; z++) {
                                if (myarr[m][j] != -1) {
                                    if (myarr[m][j] >= first && myarr[m][j] <= second && myarr[m][z] >= first && myarr[m][z] <= second && myarr[m][j] != myarr[m][z] && myarr[m][z] != -1) {
                                       
                                        count++;


                                    } 

                                }
                            }

                        }
                    }
                }

            }


           
            bw.write("Case #"+(printer+1)+": "+count);
            bw.newLine();
            bw.flush();
           }
        } catch (IOException ex) {
        } finally {
            try {
                bf.close();
            } catch (IOException ex) {
            }
        }

    }
}