
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.*;
public class Solution3
{
	public static void main(String args[]) throws IOException
	{
		BufferedReader br=new BufferedReader(new FileReader("input.txt"));
	    PrintWriter pw=new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
	    int lines=Integer.parseInt(br.readLine());
	    for(int q=1;q<=lines;q++)
	    {
	    	StringTokenizer st=new StringTokenizer(br.readLine());
	    	int A=Integer.parseInt(st.nextToken());
		    int B=Integer.parseInt(st.nextToken());
		    int ctr=0;
		    for(int n=A;n<=B;n++)
		    {
		    	for(int m=n+1;m<=B;m++)
		    	{
		    			String s1=String.valueOf(n);
			    		String s2=String.valueOf(m);
			    		int x1,x2,i;
			    		for(i=0;i<s1.length();i++)
			    		{
			    			if(s1.charAt(0)==s2.charAt(i))
			    			{
			    			String chk1=s1.substring(0,s2.length()-i);
				    		String chk2=s1.substring(s2.length()-i);
				    		String chk3=s2.substring(0,i);
				    		String chk4=s2.substring(i);
				    		if(chk1.equals(chk4)&&chk2.equals(chk3))
				    		  { ctr++;}
			    			}
			    		}        
		        }    
		    }
		    pw.println("Case #"+q+": "+ctr);
	    }
	    pw.close();
	    
	    
    }
    
}