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

import java.util.Scanner;

/**
 *
 * @author Abdo
 */
public class problemb {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        sc.nextLine();
        int[] a=new int[n];
        int[] b=new int[n];
        for(int k=0;k<n;k++)
        {
             a[k]=sc.nextInt();
             b[k]=sc.nextInt();
             sc.nextLine();
        }
        for(int k=0;k<n;k++)
        {
            int count=0;
            int i=-1;
            int num=0;
            while(a[k]+i <= b[k])
            {
                i++;
                String temp=new String();
                int alo=a[k]+i;
                temp=String.valueOf(alo);
                char[] abdo=temp.toCharArray();
                if(abdo.length<2)
                    break;
                else if(abdo.length ==2)
                {
                    char temp2=abdo[0];
                    abdo[0]=abdo[1];
                    abdo[1]=temp2;
                    String aaa= String.valueOf(abdo[0])+ String.valueOf(abdo[1]);
                    
                    num=Integer.parseInt(aaa);
                    if(num <= b[k] && num > a[k]+i)
                        count++;
                    
                }
                else
                {
                   char[] temp5=abdo;
                    char temp2=abdo[0];
                    char temp3=abdo[1];
                    abdo[0]=abdo[2];
                   abdo[1]=temp2;
                   abdo[2]=temp3;
                    
                    String aaa= String.valueOf(abdo[0])+ String.valueOf(abdo[1])+String.valueOf(abdo[2]);
                    
                    num=Integer.parseInt(aaa);
                    if(num <= b[k] && num >= a[k] && num >a[k]+i)
                        count++;
                    
                  char[] abdo2=temp.toCharArray();
                      temp2=abdo2[0];
                     temp3=abdo2[2];
                    abdo2[0]=abdo2[1];
                    abdo2[1]=temp3;
                    abdo2[2]=temp2;
                    
                       aaa= String.valueOf(abdo2[0])+ String.valueOf(abdo2[1])+String.valueOf(abdo2[2]);
                    
                    num=Integer.parseInt(aaa);
                    if(num <= b[k] && num >= a[k] && num > a[k]+i)
                        count++;
                    
                }
                
               
            }
            System.out.format("Case #%d: %d\n", k+1, count);
        }
    }
    
}
