
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.ArrayList;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
public class Q3 {
    public static void main(String[] args) throws IOException {
        Scanner reader=new Scanner(new File("D:\\C-small-attempt0 (1).in"));
        int noOfCases=reader.nextInt();
        String finalAnswer="";
        PrintWriter writer=new PrintWriter("D:\\out0.in");
        for(int loop=0;loop<noOfCases;loop++)
        {
            LinkedList<String> set=new LinkedList<String>();
            int counter=0;
            int firstNum=reader.nextInt();
            int secondNum=reader.nextInt();
            for(int currentN=firstNum;currentN<secondNum;currentN++)
            {
                String n=currentN+"";
                for(int i=1;i<=n.length()-1;i++)
                {
                    String nSubString=n.substring(n.length()-i,n.length())+n.substring(0,n.length()-i);
                    if(!nSubString.startsWith("0"))
                    {
                    if(!n.equals(nSubString))
                    {
                    int nSubInt=Integer.parseInt(nSubString);
                    if(nSubInt<=secondNum && nSubInt>(Integer.parseInt(n)))
                    {
                        if(!set.contains(n+","+nSubString))
                        {
                            set.add(n+","+nSubString);
                            counter++;
                        }
                    }
                    }
                    }
                }
            }
         finalAnswer+="Case #"+(loop+1)+": "+counter+"\n";
        }
           writer.write(finalAnswer);
            writer.flush();
            writer.close();
    }
}
