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


public class RecycleNumber {

	/**
	 * @param args
	 */
	int NoOfTestCase = 0;
	int A = 0;
	int B = 0;
	ArrayList<Integer> knownList = new ArrayList<Integer>();
	public static void main(String[] args) {
		// TODO Auto-generated method stub 
		RecycleNumber rn = new RecycleNumber();
		Scanner sc = new Scanner(System.in);
		rn.NoOfTestCase = Integer.parseInt(sc.nextLine());
		for(int i=0;i<rn.NoOfTestCase;i++)
		{
			String input = sc.nextLine();
			String[] inputArr = input.split(" ");
			rn.A = Integer.parseInt(inputArr[0]);
			rn.B = Integer.parseInt(inputArr[1]);
			System.out.println("Case #"+(i+1)+": "+rn.solve());
		}
	}
	private int solve()
	{
		int result = 0;
		Integer currInt = 0;
		Integer newInt = 0;
		Integer temp = 0;
		String resultStr = "";
		boolean firstTime = true;
		for(int i=A;i<=B;i++)
		{
			currInt = i;
			if(true)
			{
				newInt = currInt;
				resultStr = newInt.toString();
				firstTime = true;
				while((newInt.compareTo(currInt)!=0) || firstTime)
				{
					temp = newInt;
					resultStr = rotate(resultStr);
					newInt = Integer.parseInt(resultStr);
					if(A>=newInt)
					{
						while(newInt>A)
						{
							newInt = temp;
							resultStr = rotate(resultStr);
							newInt = Integer.parseInt(resultStr);
						}
					}
					if(newInt>currInt)
					{
						if(A< newInt && B >= newInt)
						{
							knownList.add(newInt);
							result++;
						}
					}
					firstTime = false;
				}
			}
		}
		return result;
	}
	private String rotate(String s){
		String[] str = s.split("");
		String last = str[str.length-1];
		for(int i=str.length-1;i>1;i--)
		{
			str[i] = str[i-1];
		}
		str[1] = last;
		String result = "";
		for(int i=1;i<str.length;i++)
			result = result+str[i];
		return result;
	}

}
