/*
 * 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 Recycled {
    public static void main(String[] args)throws IOException{
        new SolveRecycled();
    }
}
class SolveRecycled{
    public SolveRecycled()throws IOException
    {
        Scanner sc, oScan,scan;
        System.setOut(new PrintStream(new File("Recycled.out")));
        sc=oScan=scan=new Scanner(new File("Recycled.dat"));

        int runs = Integer.parseInt(sc.nextLine());
        for(int r123=1; r123<=runs; r123++)
        {
            System.out.print("Case #"+r123+": ");
            int A = sc.nextInt();
            int B = sc.nextInt();
            int count=0;
            ArrayList<pair>list = new ArrayList<pair>();
            for(int i=A; i<=B; i++)
            {
                String num=""+i;
                for(int j=0; j<num.length();j++)
                {
                    String t = num.substring(j)+num.substring(0,j);
                    pair p = new pair(i,Integer.parseInt(t));
                    if(!t.equals(num)&&(""+Integer.parseInt(t)).length()==num.length()&&!list.contains(p)&&Integer.parseInt(t)<=B&&i<Integer.parseInt(t))
                    {
                        list.add(p);
//                        System.out.println(p);
                    }
                }
            }
            System.out.println(list.size());

        }
    }


}
class pair{
    int one,two;
    public pair(int o, int t){
        one=o;
        two=t;
    }
    public boolean equals(Object o){
        pair p = (pair)o;
        return p.one==one&&p.two==two||p.one==two&&p.two==one;
    }
    public String toString(){
        return one+" - "+ two;
    }
}