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


public class RecycledNumbers {

	/**
	 * @param args
	 */
	static int a = -1;
	static int b = -1;
	static int T = -1;
	static int A = -1;
	static int B = -1;
	static File newFile = null;
	static Scanner scan = null;
	static int[] n = null;
	static int[] m = null;
	static int q = 1;
	static int num = 1;
	static int count = 0;

	public static void main(String[] args) throws IOException {


		try 
		{
			
			newFile = new File("C:/Users/PANKAJJAKHAR/Desktop/small.in");
			scan = new Scanner(newFile);
			scan.hasNextLine();
			T = scan.nextInt();
			while(scan.hasNextLine())
			{
				if(!scan.hasNextInt())
					return;
//				A = scan.nextInt();
//				B = scan.nextInt();
				
				for(int f = 0; f < 1; f++)
				{
					A = scan.nextInt();
					B = scan.nextInt();
				}
				int nMin = A;
				int nMax = B - 1;
				int mMax = B;
				int mMin = A + 1;
				
				int c = 0;
				n = new int[B - A];
				m = new int[B - A];
				//fill n values
				
				for(int i = nMin; i <= nMax; i++)
				{
					n[c] = i;
//					System.out.print(" " + n[c]);
					c++;
				}
				
				int x = 0;
				//fill m values
				for(int j = mMin; j <= mMax ; j++)
				{
					m[x] = j;
//					System.out.print(" " + m[x]);
					x++;
				}
				
				
				int lenNnum = -1;
				for(int i = 0; i < n.length; i++)
				{
					int numN = n[i];
					String numNStr = Integer.toString(numN);
					lenNnum = numNStr.length();
//					if(lenNnum == 1)
//					{
//						
//					}
//					else 
					for(int j = 0; j < m.length; j++)
					{
						int mNumber = m[j];
						if(n[i] < mNumber)
						{
							for(int k = 0; k < lenNnum - 1; k++)
							{
								String newNumLead = numNStr.substring(0, k + 1);
								String newNumTrail = numNStr.substring(k + 1);
								String finalStr = newNumTrail + newNumLead;
								int lenFinalStr = finalStr.length();
								int finalInt = Integer.parseInt(finalStr);
								
								String mNumStr = Integer.toString(m[j]);
								int lenmNumStr = mNumStr.length();
//								if(lenFinalStr == lenmNumStr)
//								{
									if(finalInt == mNumber)
									{
										count = count + 1;
									}
//								}
							}
						}
					}
				}
								
				System.out.println("Case #" + num + ": " + count);
				num++;
				count = 0;
//				System.out.println(count);
			}
		} 
		catch (FileNotFoundException e) 
		{
			e.printStackTrace();
		}
		
		
	}

}
