/*
 * 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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashSet;
import java.util.Set;

public class G3 {

    public static void main(String[] args) throws Exception {
        BufferedReader in = new BufferedReader(new FileReader("d:\\C-small-attempt0.in"));
        int n = Integer.parseInt(in.readLine());
        BufferedWriter out = new BufferedWriter(new FileWriter("d:\\g3o.txt"));
        int from, to;
        for (int i = 1; i <= n; i++) {
            String[] s = in.readLine().split(" ");
            from = Integer.parseInt(s[0]);
            to = Integer.parseInt(s[1]);
            int answer = solve(from, to);
            System.out.println("Case #" + i + ": " + answer);
            out.write("Case #" + i + ": " + answer);
            out.newLine();
        }
        out.close();
    }

    private static int solve(int from, int to) {
        int result = 0;
        int digits = (int) Math.floor(Math.log10(from));
        Set<String> set = new HashSet<String>();
        for (int i = from; i <= to; i++) {
            int base10 = 10;
            int baseBig10 = (int) Math.pow(10., digits);
            for (int l = 0; l < digits; l++) {
                int cycled = baseBig10 * (i % base10) + (i/base10);
                if (cycled != i && cycled>=from && cycled <= to) {
                    result++;
                    if (!set.add(String.valueOf(i)+" "+cycled))
                    System.err.println(i +" <->"+cycled);
                }
                base10 *= 10;
                baseBig10 /= 10;
            }
        }
        return set.size()/2;
    }
}
