/*
 * 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.*;
class C3
{
    public static void main(String args[])throws IOException
    {
        FileReader fi = new FileReader("C-small-attempt3.in");
        Scanner in = new Scanner(fi);
        FileWriter fr = new FileWriter("C3-output.out");
        BufferedWriter bw = new BufferedWriter(fr);
        PrintWriter pw = new PrintWriter(bw);
        int T = in.nextInt();
        int ab[][] = new int[T][2];
        for(int i=0;i<T;i++)
        {
            ab[i][0] = in.nextInt();
            ab[i][1] = in.nextInt();
        }
        in.close();
        fi.close();
        for(int i=0;i<T;i++)
        {
            int A = ab[i][0];
            int B = ab[i][1];
            int c=0;
            for(int j=A;j<=B;j++)
            {
                int n = j;
                for(int k=n+1;k<=B;k++)
                {
                    int m = k;
                    if(recycle(n,m))
                    c++;
                }
            }
            pw.println("Case #"+(i+1)+": "+c);
        }
        pw.close();
        bw.close();
        fr.close();
    }
    static boolean recycle(int n,int m)
    {
        int tn =n;
        int c=0;
        while(tn>0)
        {
            tn= tn/10;
            c++;
        }
        tn=n;
        int tn2 = n;
        boolean flag = false;
        while(tn>0)
        {
            int d = tn%10;
            tn = tn/10;
            int tp = (int)Math.pow(10,c-1);
            tn2 = tn2/10;
            tn2 = tp*d+tn2;
            if(tn2==m)
            {
                flag = true;
                break;
            }
        }
        return flag;
    }
}
