/*
 * 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.ArrayList;
import java.util.StringTokenizer;

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

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

    /**
     * @param args the command line arguments
     */
     public static void main(String[] args) throws FileNotFoundException, IOException {
        // TODO code application logic here
        BufferedReader R=new BufferedReader(new FileReader("C:\\Users\\doda\\Desktop\\C-small.in"));
        PrintWriter P=new PrintWriter(new FileWriter("C:\\Users\\doda\\Desktop\\small.txt"));
        while(R.ready()){
            int t=Integer.parseInt(R.readLine());
            for(int i=0;i<t;++i){
               StringTokenizer s=new StringTokenizer(R.readLine());
               int n=Integer.parseInt(s.nextToken());
               int m= Integer.parseInt(s.nextToken());
               int out=0;String O="Case #"+(i+1)+":";
               for(int j=n;j<m;++j){
                   int numbers[]=diffOrder(j);
                   for(int k=0;k<numbers.length;++k){
                       if(numbers[k]>j && numbers[k]<=m)++out;
                   }
               }
               O+=" "+out;
               P.println(O);
            }
        }
        P.close();
    }
    public static int [] diffOrder(int num){
        String s=""+num;
        ArrayList<Integer> in=new ArrayList<Integer>();
        int re[];
        for(int i=0;i<s.length()-1;++i){
            s=s.charAt(s.length()-1)+""+s.substring(0,s.length()-1);
            int y=Integer.parseInt(s);
            String h=""+y;
            if(h.length()<s.length())y=0;
            if(!in.contains(y))in.add(y);
        }
        re=new int[in.size()];
        for(int i=0;i<in.size();++i){
            re[i]=in.get(i);
        }
        return re;
    }
}
