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

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}


import java.io.*;
import java.util.HashSet;
import java.util.StringTokenizer;

public class Main {

    public static void main(String[] args) throws IOException {

        String file = "C-small-attempt0";
        BufferedReader in = new BufferedReader(new FileReader(file + ".in"));
        FileWriter archivo = new FileWriter(file+".out");
        PrintWriter outs = new PrintWriter(archivo);
        outs.flush();
        //BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

        int n = Integer.parseInt(in.readLine());
        for (int i = 1; i <= n; i++) {
            HashSet<String> k = new HashSet<String>();
            StringTokenizer token = new StringTokenizer(in.readLine());
            int a = Integer.parseInt(token.nextToken()), b = Integer.parseInt(token.nextToken());
            for (int j = a; j <= b; j++) {
                String r = String.valueOf(j);
                if (j < 100) {
                    String test1 = new StringBuilder(r).reverse().toString();

                    if (!r.equals(test1)) {
                        int comparer = Integer.parseInt(test1);

                        if (a <= comparer && comparer <= b) {
                            //System.out.println(comparer);
                            int lol = Integer.parseInt(r);
                            String container = Math.max(comparer, lol) + " - " + Math.min(comparer, lol);
                            //System.out.println(container);
                            if (!k.contains(container)) {
                                k.add(container);
                            }
                        }
                    }
                } else {
                    //System.out.println(r.length());
                    for (int c = 1; c < r.length(); c++) {

                        String test1 = r.substring(c);
                        String test2 = r.substring(0, c);
                        //System.out.println(test1+test2);
                        if (!r.equals(test1 + test2)) {
                            int comparer = Integer.parseInt(test1+test2);

                            if (a <= comparer && comparer <= b) {
                                //System.out.println(comparer);
                                int lol = Integer.parseInt(r);
                                String container = Math.max(comparer, lol) + " - " + Math.min(comparer, lol);
                                //System.out.println(container);
                                if (!k.contains(container)) {
                                    k.add(container);
                                }
                            }
                        }

                    }
                }
            }
            outs.println("Case #" + i + ": " + k.size());
        }





        outs.close();
        in.close();
        System.exit(0);

    }
}
