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

public class RecycledNumbers
{
	public static void main(String[] args)throws Exception
	{
		File f = new File("recyclednumbers.txt");
		File outp = new File("recyclednumbers.out");
		Scanner sc = new Scanner(new FileReader(f));
		Writer wr = new BufferedWriter(new FileWriter(outp));
		int t = sc.nextInt();
		for(int casse=1; casse<=t; casse++)
		{
			String as = sc.next(), bs = sc.next();
			int a = Integer.parseInt(as), b = Integer.parseInt(bs);
			boolean[][] check = new boolean[b-a+1][b-a+1];
			int digits = (int) (Math.ceil(Math.log10(b)));
			for(int i=a; i<=b; i++)
			{
				String temp1 = new Integer(i).toString();
				//StringBuffer temp1 = new StringBuffer(s);
				int start=0;
				for(int j=1; j<=digits; j++)
				{
					StringBuffer temp2 = new StringBuffer(temp1.length());
					int count = 1;
					for(int k=start; count<=digits; count++, k=(k+1)%digits)
						temp2.append(temp1.charAt(k));
					start++;
					if(temp2.charAt(0)=='0')
						continue;
					int n1 = Integer.parseInt(temp1.toString());
					int n2 = Integer.parseInt(temp2.toString());
					if(a<=n2 && n2<=b)
						check[n1-a][n2-a] = check[n2-a][n1-a] = true;
				}
			}
			int count = 0;
			for(int i=0; i<check.length; i++)
				for(int j=i+1; j<check[i].length; j++)
					if(check[i][j])
						count++;
			wr.write("Case #"+casse+": "+count+"\n");
		}
		sc.close();
		wr.close();
		return;
	}
}