/*
 * 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;
    }

}

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

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.math.BigInteger;
import java.util.LinkedList;
import java.util.Scanner;

/**
 *
 * @author alei
 */
public class C {
    public static void main(String[] Args) throws FileNotFoundException{
        Scanner sn = new Scanner(new FileInputStream("c.in"));
        System.setOut(new PrintStream("c.out"));
        int nCases = sn.nextInt();
        for(int i=0;i<nCases;i++){
            //System.out.println("Case #"+(i+1));
            sn.nextLine();            
            int A = sn.nextInt();
            int B = sn.nextInt();
            int nRec = calcRecycled(A,B);
            System.out.println("Case #"+(i+1)+": "+nRec);
        }
    }
    private static int calcRecycled(int A, int B) {
        int nRecycleds = 0;
        for(int n=A;n<=B;n++){
            String strNumber = n+"";            
            String curFt = "";
            LinkedList<String>pairs = new LinkedList<>();
            for(int j=0;j<strNumber.length()-1;j++){                                                        
                char curChar = strNumber.charAt(strNumber.length()-j-1);                
                if(curChar!='0'){
                    curFt =curChar + curFt;
                    String m = curFt+strNumber.substring(0,strNumber.length()-j-1);
                    int mint = Integer.parseInt(m);
                    if(mint>n){
                        if(mint>=A && mint <=B){
                            if(!pairs.contains(m)){
                                nRecycleds++;
                                pairs.add(m);
                            }
                            
                        }
                    }                   
                }              
                else{
                    curFt =curChar + curFt;
                }
            }
            
        }
        return nRecycleds;
    }
}
