
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 codejam2
{

    void kick() throws IOException

    {
        FileReader fr=new FileReader("input.in");
        BufferedReader br=new BufferedReader(fr);

        FileWriter fw=new FileWriter("output.in");
        BufferedWriter bw=new BufferedWriter(fw);
        PrintWriter pw=new PrintWriter(bw);

        String txt="";
        int tc=Integer.parseInt(br.readLine());
        int c=0;
        

        while((txt=br.readLine())!=null)
        {

            StringTokenizer st=new StringTokenizer(txt);
            int a=Integer.parseInt(st.nextToken());
            int b=Integer.parseInt(st.nextToken());
            int posi=0;

            for(int i=a; i<b; i++)
            {
                for(int j=i+1; j<=b; j++)
                {
                    String a1=Integer.toString(i);
                    String b1=Integer.toString(j);

                    if(pos(a1,b1))
                       { posi++;}

                }
            }
            
            c++;
            pw.println("Case #"+c+": "+posi);

        }
        
        

        pw.close();
        bw.close();
        fw.close();

        br.close();
        fr.close();
    }

    boolean pos(String s,String p)
    {

        p=p+p;

        for(int j=0; j<s.length(); j++)
        {
            String subs=p.substring(j,j+(s.length()));
            if(s.equalsIgnoreCase(subs))
            {
                return true;
            }
        }
        return false;
    }
}