/*
 * 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.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Hashtable;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author sanket
 */
public class RecycledNumbers {

    public static void main(String[] args) {
        // TODO code application logic here
        try {
            FillHash();
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            // Get the object of DataInputStream
            DataInputStream in = new DataInputStream(fstream);


            //System.out.print(" Enter N :");
            BufferedReader br;
            br = new BufferedReader(new InputStreamReader(in));
            ReadFile(br);


        } catch (Exception ex) {
            ex.printStackTrace();
        }
    }

    public static void FillHash() {
    }

    public static String GetNumbersOfPair(long A, long B) {

        ArrayList<String> a = new ArrayList<String>();


        int cnt = 0;
        for (long i = A; i <= B; i++) {

            for (long j = i; j <= B; j++) {

                String word = String.valueOf(j);
                for (int k = 0; k < word.length(); k++) {
                    StringBuilder w = new StringBuilder();
                    w.append(word.substring(word.length() - (k + 1), word.length()));
                    w.append(word.substring(0, word.length() - (k + 1)));
                    //System.out.println(w + "  word :" + word);

                    if (i == Long.parseLong(w.toString()) && i != j) {

                        // for distinct pair 
                        if (!a.contains(i + "" + j)) {
                            a.add(i + "" + j);
                            cnt++;
                        }



                    }
                }

            }


        }


        return cnt + "";

    }

    public static void ReadFile(BufferedReader br) {
        try {
            String output = "";
            StringBuilder sb = new StringBuilder();
            int N = Integer.parseInt(br.readLine());

            int items[] = new int[N];
            for (int i = 0; i < N; i++) {
                StringBuilder sbTemp = new StringBuilder(br.readLine());
                sb.append("Case #");
                sb.append((i + 1));
                sb.append(": ");

                String A = String.valueOf(sbTemp.substring(0, sbTemp.indexOf(" ")));
                String B = String.valueOf(sbTemp.substring(sbTemp.indexOf(" ") + 1, sbTemp.length()));

                sb.append(GetNumbersOfPair(Long.parseLong(A), Long.parseLong(B)));


                output = output + sb + "\n";
                sb.delete(0, sb.length());
            }

            // output starts         
            System.out.print(output);
        } catch (Exception ex) {
        }
    }
}
