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


public class Solution {
	
	public void output(BufferedWriter out, int caseNum, 
			int time) throws IOException
	{
		out.write("Case #" + caseNum + ": " + time + "\n");		
	}
	
	public void solve() throws IOException
	{

		Scanner scan = new Scanner(new File("src/C-small-attempt0.in"));
		BufferedWriter out = new BufferedWriter(new FileWriter
				("C-small-attempt0.out"));

		int cases = scan.nextInt();
		
			for(int i = 1; i <= cases;i++){
					int A = scan.nextInt();
					int B = scan.nextInt();
					int count = 0;
					int j = 0;
					String [] arr = new String[B-A+1];
					
					for(int n = A; n <= B; n++){
						arr[j] = Integer.toString(n);
						j++;
					}
					
					for(int k = 0; k < arr.length; k++){
						for(int l = k+1; l < arr.length; l++){
							int zz = 1;
							int len = arr[k].length();
							while(zz < len){
								if(arr[k].endsWith(arr[l].substring(0, len-zz))){
									if(arr[k].startsWith(arr[l].substring(len-zz))){
										count++;
										break;
									}
								}
								zz++;
							}
						}
					}
					System.out.format("Case #%d: %d\n", i, count);
					output(out, i, count);
			}
		
		out.close();	
	}
	
	public static void main(String[] args) throws IOException
	{
		Solution sol = new Solution();
		sol.solve();
		
	}

}

