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

import java.io.*;
import java.util.ArrayList;

/**
 *
 * @author BUDDHIMA
 */
public class Codejam2012 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws Exception {
        // TODO code application logic here

        BufferedReader br = new BufferedReader(new FileReader("C-small-attempt0.in"));
        BufferedWriter out = new BufferedWriter(new FileWriter(new File("outputC-small.txt")));

        int tests = Integer.parseInt(br.readLine());

        for (int testIndex = 1; testIndex <= tests; testIndex++) {

            int count = 0;

            String[] lineParts = br.readLine().split(" "); // A B

            if (lineParts[0].length() < 2) {
                out.write("Case #" + testIndex + ": " + 0 + "\n");
                continue;


            } else {

                int A = Integer.parseInt(lineParts[0]);
                int B = Integer.parseInt(lineParts[1]);


                for (int x = A; x < B; x++) {
                    
                    ArrayList<Integer> preAdded=new ArrayList<Integer>(); //memory
                    
                    for (int i = 1; i < lineParts[0].length(); i++) {
                        String numpart1 = String.valueOf(x).substring(0, i);
                        String numpart2 = String.valueOf(x).substring(i);

                        int newnum = Integer.parseInt(numpart2 + numpart1);
                        
                        
                        
                        if (newnum <= B && x < newnum) {
                            boolean isIn=false;
                            
                            for(int y=0;y<preAdded.size();y++){
                            if(preAdded.get(y)==newnum){
                            isIn=true;
                            break;
                            }
                            }
                            
                            if(!isIn){
                            System.out.println(x + "-->" + newnum);
                            count++;
                            preAdded.add(newnum);
                            isIn=false;
                            }
                        }



                    }
                }

            }

//print results
            out.write("Case #" + testIndex + ": " + count + "\n");

        }



        out.close();
    }
}
