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

import java.util.Scanner;

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

    public void solve() {

        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        int i = 0, j = 0, k = 0;
        int count = 0;
        int A = 0, B = 0, n = 0, m = 0, a = 0, b = 0;//A â¤ n < m â¤ B
        String nn = "";
        String mm = "";
        while (i < T) {
            // System.out.println("a");
            n = A = sc.nextInt();
            m = B = sc.nextInt();
            count = 0;

            while (n <= B) {
               // System.out.println("a");
                while (m >= A && m > n) {
                  //  System.out.println("b");
                    nn = String.valueOf(n);
                    mm = "[" + String.valueOf(m) + "]";
                   // System.out.println("nn == : " + nn + "  mm == : " + mm);
                    if (nn.length()==(mm.length()-2) && nn.replaceAll(mm, "").equals("")    ) {
                     //   System.out.println("ccc");
                        if (isCorrect(n, m)) {
                            count++;
                        }
                    }

                    --m;
                }
                m = B;
                ++n;
            }
            System.out.println("Case #"+(i+1)+": " + count);

            ++i;
        }

    }
    // length n == lengt m

    public boolean isCorrect(int n, int m) {

        String nn = String.valueOf(n);
        String mm = String.valueOf(m);
        int len = nn.length();
        int i = 0;
        if (nn.equals(mm) && len > 1) {
            return true;
        } else {
            i = 1;
            while (i < len) {

                if (nn.charAt(i) == mm.charAt(0) && nn.charAt(i - 1) == mm.charAt(len - 1)) {
                    String tem = nn.substring(i, len) + nn.substring(0, i);
                    if (tem.equals(mm)) {
                        return true;
                    }
                }
                ++i;
            }
        }
        return false;

    }

    public static void main(String[] args) {
        new RecycledNumbers().solve();


        /*
         * String s = "12345"; String tem = s.substring(2, s.length()) +
         * s.substring(0, 2); System.out.println(tem); String a = "21345";
         * String ss = "[" + a + "]"; //String e = s.replaceAll(ss, "");
         * //System.out.println("e is = " + e);
         *
         * if(s.replaceAll(ss, "").equals("")){
         * System.out.println("aaaaaaaaaaaaaa"); }else{
         * System.out.println("bbbbbbbbbbbbb"); }
         */
    }
}
