/*
 * 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.*;
import java.util.*;

public class codejam2 {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        File file = new File("C-small-attempt0.in");
        FileReader fr = new FileReader(file);
        Scanner ob = new Scanner(fr);
        File outFile = new File("outFile2.txt");
        FileWriter outFilew = new FileWriter(outFile);
        int t,r=1;
        t = ob.nextInt();
        while (t != 0) {
            int a, b;
            a = ob.nextInt();
            b = ob.nextInt();
            int i, j, k, count = 0;
            for (i = a; i < b; i++) {
                j = i;
                int h[]=new int[8];
                int c=0;
                String no = Integer.toString(j);
                for (k = no.length()-1; k>=0;k--) {
                    String temp = "";
                    temp=no.substring(k)+no.substring(0,k);
                    int s = Integer.parseInt(temp);
                    if (s > j && s <= b ) {
                        int flag=0;
                        for(int m=0;m<c;m++){
                            if(h[m]==s)
                                flag=1;
                        }
                        if(flag==0){
                        count++;
                        h[c++]=s;
                        //System.out.println(i+", "+s);
                        }
                    }
                }
            }
            //System.out.println("Case #"+r+": "+count);
            outFilew.append("Case #"+r+": "+count+"\n");
            t--;
            r++;
        }
        outFilew.close();
    }

}
