/*
 * 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.Scanner;
public class jam3Rec {
	
	public static void main(String args[]) throws java.lang.Exception
	{
		
		int a,b,n,m, cnt=0,len=0;
		//a=1111;b=2222;
		int t,cas=1;
		//System.out.println();
		//Scanner scan=new Scanner(System.in);
    	//Scanner scan=new Scanner(new FileReader("input3" + ".in"));
		Scanner scan=new Scanner(new FileReader("C-small-attempt2" + ".in"));
		
		PrintWriter out=new PrintWriter("SmallOutput5" + ".out");
		//PrintWriter out=new PrintWriter("LocalOutput3" + ".out");
		
		//FileReader("A-small-attempt1" + ".in")
		t=scan.nextInt();
		while(t!=0)
		{
		t--;
		cnt=0;
		a=scan.nextInt();
		b=scan.nextInt();
		
		//a=100;b=500;
		String str1,tstr1;
		
		for(int i=a;i<=b;i++)
		{
			str1=Integer.toString(i);
			for(int j=a;j<=b;j++)
			{
				if(i!=j && i<j)
				{
					len=str1.length();
					for(int k=1;k<len;k++)
					{
						tstr1=str1.substring(0,len-k);
						tstr1=str1.substring(len-k)+tstr1 ;
						
						if(tstr1.equals(Integer.toString(j)))
						{
							k=len;
							//System.out.println(i+"  "+"  "+j+"  "+tstr1);
							cnt++;
						}
						
						
						
					}
					
					
				}
				
				
			}
		}
		//cnt=cnt/2;
	
		System.out.println("Case #"+cas+": "+cnt);
		out.println("Case #"+cas+": "+cnt);
		cas++;
		
		
		}
	
	//in.close();
	out.close();
	}

}
