/*
 * 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.util.*;
import java.io.*;
public class Josephus {
   public static void main(String[] args)throws IOException {
     FileInputStream is = null;
     try {
       is = new FileInputStream("input.txt");
       DataInputStream in = new DataInputStream(is);
       BufferedReader br = new BufferedReader(new InputStreamReader(in));
       String str;
       int n;
       String sn;
       int m;
       String sm;
       int counter = 0;
       int loop = Integer.parseInt(br.readLine());
       ArrayList<Integer> nlist = new ArrayList<Integer>();
       ArrayList<Integer> mlist = new ArrayList<Integer>();
       
       for (int i = 0 ; i < loop ; i++)  {
         str = br.readLine();
         n = Integer.parseInt(str.substring(0,str.length()/2));
         m = Integer.parseInt(str.substring(str.length()/2+1,str.length()));
         for (int k = n ; k < m ; k++){
           String current = Integer.toString(k);
           for (int j = 0; j< current.length()-1; j++){
             char c = current.charAt(0);
             current += c;
             
             current = current.substring (1,current.length());
             int check = Integer.parseInt(current);
             if (check > k && check <= m){
               nlist.add(k);
               mlist.add(check);
              // System.out.println(k+" , "+current);
               counter++;
              }
           }
         }
         System.out.println("Case #"+(i+1)+": "+counter);
         //System.out.println(nlist);
         //System.out.println(mlist);
         counter = 0; 
       }
 
       in.close();
     }catch (Exception e){//Catch exception if any
       System.err.println("Error: " + e.getMessage());
     }
   }
}