/*
 * 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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.StringTokenizer;


public class jamc {
public static boolean b=false;
public static Scanner in;
public   static PrintWriter out;



static boolean recycle(int i,int j)
{
	String n=""+i+"";
	String m=""+j+"";
	
	for(int k=0;k<n.length();k++)
	{
		
		if(m.equals(n.substring(1)+n.substring(0, 1)))
		{
			return true;
		}
		n=n.substring(1)+n.substring(0, 1);
		
		
	}
	
	
	
	
	return false;
}

	
	public static void ecrire(String s)
	{
		if(b)
		{
			out.println("");
		}
		b=true;
		out.print(s);
		
		
		
	}

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		
         in=new Scanner(new File("C-small-attempt9.in"));
		 out=new PrintWriter("c.out");
	in.nextLine();
	int j=1;
	while(in.hasNext())
	{
		
		int compt=0;
		String s=in.nextLine();
		String resultat="";
		StringTokenizer tk=new StringTokenizer(s);
		String n=tk.nextToken();
		String m=tk.nextToken();
		int nint=Integer.parseInt(n);
		int mint=Integer.parseInt(m);
		for(int par=nint;par<=mint;par++)
		{
			for( int par1=nint;par1<=mint;par1++)
			{
				if(recycle(par,par1)&&(par!=par1))
					compt++;
				
				
			}
			
			
			
		}
		resultat="Case #"+j+": "+compt/2+"";
		ecrire(resultat);
		j++;
		
		
		}
		
		
	
	
	
	
	

	
	
	
	
	
	in.close();
	out.close();

	}

}
