
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
import java.io.*;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class C {
    public static void main(String [] args) throws IOException {
        TreeSet<String> ts=new TreeSet<String>();
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int c=Integer.parseInt(br.readLine().trim());
        FileWriter fichero = new FileWriter("largoa.txt");
        PrintWriter pw = new PrintWriter(fichero);
        for(int kc=0;kc<c;kc++){
            int l,h;
            StringTokenizer st=new StringTokenizer(br.readLine());
            l=Integer.parseInt(st.nextToken());
            h=Integer.parseInt(st.nextToken());
            for(int i=l;i<=h;i++){
                String a=String.valueOf(i);
                String n="";
                for(int k=1;k<a.length();k++){
                    n=a.substring(k,a.length())+ a.substring(0,k);
                    if(String.valueOf(Integer.parseInt(n)).length()==a.length() && !n.equals(a)){
                            if(Integer.parseInt(n)<=h &&Integer.parseInt(n)>=l){
                                ts.add(a+" "+n);
                                ts.add(n+" "+a);
                            }
                          }
                    }
                }
            System.out.println("Case #"+(kc+1)+": "+ts.size()/2);
            //pw.println("Case #"+(kc+1)+": "+ts.size()/2);
            ts.clear();
        }
        fichero.close();
    }
}