/*
 * 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 codejam.StoreCredit;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedHashSet;
import java.util.Set;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author java
 */
public class RecycledNumbers {

    static BufferedReader in;

    private static void open() {
        in = new BufferedReader(new InputStreamReader(System.in));
    }

    private static void close() {
        try {
            in.close();
        } catch (IOException ex) {
            Logger.getLogger(StoreCredit.class.getName()).log(Level.SEVERE, null, ex);
        }
    }

    private static int readInt() throws IOException {
        Integer i = Integer.parseInt(in.readLine());
        return i;
    }

    private static int[] readInts() throws IOException {
        String[] vals = in.readLine().split(" ");
        int[] arr = new int[vals.length];
        for (int i = 0; i < vals.length; i++) {
            arr[i] = Integer.parseInt(vals[i]);
        }
        return arr;
    }

    public static void main(String[] args) throws IOException {
        open();
        int T = readInt();
        for (int t = 0; t < T; t++) {
            int[] arr = readInts();
            int A = arr[0];
            int B = arr[1];
            Set<Integer> set = new LinkedHashSet<Integer>();
            Set<Integer> additionalSet = new HashSet<Integer>();
            while (A <= B) {
                String v = String.valueOf(A);
                set.add(A);
                A++;
            }
            Iterator<Integer> it = set.iterator();
            Set<String> used = new LinkedHashSet<String>();
            StringBuilder b = new StringBuilder();
            while (it.hasNext()) {
                int val = it.next();
                it.remove();
                b.delete(0, b.length());
                b.append(val);
                int iteration = b.length();
                boolean added = false;
                if (iteration > 1) {
                    for (int i = 0; i < iteration - 1; i++) {
                        char c = b.charAt(0);
                        b.deleteCharAt(0);
                        b.append(c);
                        String newItem = b.toString();

                        // remove leading 0
                        int j = 0;
//                    for (; j < newItem.length() && newItem.charAt(j) == '0'; j++);
//                    newItem = newItem.sub1string(j);
                        int newNumber = Integer.parseInt(newItem);
                        if ((set.contains(newNumber)
                                || additionalSet.contains(newNumber)) && !used.contains(val + "#" + newNumber)) {
                            used.add(val + "#" + newNumber);
                            added = true;
                        }
                    }
                }
                if (!added) {
                    additionalSet.add(val);
                }

            }
            System.out.println("Case #" + (t + 1) + ": " + used.size());
//        System.out.println(used);
        }
        close();
    }
}
