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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author joshuahm
 */
public class codejamC {
    public static void main(String[] args) throws FileNotFoundException, IOException {
        FileReader inFile = new FileReader("C-small-attempt0.in");
        Scanner in = new Scanner(inFile);
        FileWriter outFile = new FileWriter("C-small-attempt0.out");
        PrintWriter out = new PrintWriter(outFile);
        //Scanner in = new Scanner(System.in);
        
            ArrayList<String> temp2 = new ArrayList<String>();
            String temp;
            
            for(int i=1;i<10;i++)
                for(int j=0;j<10;j++)
                {
                    temp = "" + i + j; 
                    temp2.add(temp);
                }
            
            for(int i=1;i<10;i++)
                for(int j=0;j<10;j++)
                    for(int k=0;k<10;k++)
                    {
                        temp = "" + i + j + k ; 
                        temp2.add(temp);
                    }
            
            for(int i=1;i<10;i++)
                for(int j=0;j<10;j++)
                    for(int k=0;k<10;k++)
                        for(int l=0;l<10;l++)
                        {
                            temp = "" + i + j + k + l; 
                            temp2.add(temp);
                        }
            
            for(int i=1;i<10;i++)
                for(int j=0;j<10;j++)
                    for(int k=0;k<10;k++)
                        for(int l=0;l<10;l++)
                            for(int m=0;m<10;m++)
                            {
                                temp = "" + i + j + k + l + m; 
                                temp2.add(temp);
                            }
            
            for(int i=1;i<10;i++)
                for(int j=0;j<10;j++)
                    for(int k=0;k<10;k++)
                        for(int l=0;l<10;l++)
                            for(int m=0;m<10;m++)
                                for(int n=0;n<10;n++)
                                {
                                    temp = "" + i + j + k + l + m + n; 
                                    temp2.add(temp);
                                }
                for(int j=0;j<10;j++)
                    for(int k=0;k<10;k++)
                        for(int l=0;l<10;l++)
                            for(int m=0;m<10;m++)
                                for(int n=0;n<10;n++)
                                    for(int p=0;p<10;p++)
                                {
                                    temp = "" + '1' + j + k + l + m + n + p; 
                                    temp2.add(temp);
                                }
           
            String[] perms = new String[temp2.size()];
            temp2.toArray(perms);     
            int total=0;
            int x;
        
        int T= in.nextInt();
        for(int t=0;t<T;t++)
        {
            total=0;
            int A= in.nextInt();
            int B= in.nextInt();    
            HashSet<Integer> distinct = new HashSet<Integer>();
            for(int i=0;i<perms.length;i++)
            {
                if(Integer.parseInt(perms[i])>B)
                    break;
                distinct.clear();
                temp = perms[i];
                if(Integer.parseInt(perms[i])>=A && Integer.parseInt(perms[i])<=B)
                {
                    distinct.add(Integer.parseInt(perms[i]));
                    for(int j=0;j<perms[i].length()-1;j++)
                    {
                        temp=temp.substring(1)+ temp.charAt(0);
                        x = Integer.parseInt(temp);
                        if(x<=B && x>=A && temp.charAt(0) != '0')
                            distinct.add(x);
                    }   
                    total+= distinct.size()-1;
                    //if(distinct.size()>1)
                       // System.out.println(perms[i] + "   " + (distinct.size()-1));
                } 
            }            
            out.println("Case #"+ (t+1) +": " + total/2);
        }
        in.close();
        out.close();
    }
}
