
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;
	}
	

}
/*
ID: lovelacer
LANG: JAVA
PROG: candy
*/
import java.io.*;
import java.util.*;
public class recycle
{
    public static void main (String [] args) throws IOException
    {
        BufferedReader f = new BufferedReader(new FileReader("recycle.txt"));
        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("recycle1.txt")));
        
        int T = Integer.parseInt(f.readLine());
        
        HashSet<String> checked;
        
        String[] nums;
        
        for(int k = 1; k <= T; k++)
        {
            nums = f.readLine().split(" ");
            int A = Integer.parseInt(nums[0]), B = Integer.parseInt(nums[1]), ans = 0;
            for(int n = A; n < B; n++)
            {
                checked = new HashSet<String>();
                String a = "" + n;
                String tmp = a.substring(1) + a.substring(0, 1);
                while(!tmp.equals(a))
                {
                    if(Integer.parseInt(tmp) <= B && Integer.parseInt(tmp) > n && !checked.contains(tmp))
                    {
                        ans++;
                        checked.add(tmp);
                    }
                    tmp = tmp.substring(1) + tmp.substring(0, 1);
                }
            }
            
            out.println("Case #" + k + ": " + ans);
        }
        
        out.close();
        System.exit(0);
    }
}