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

}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package googl2;

/**
 *
 * @author Mimo
 */
import java.io.*;
import java.util.Scanner;
public class Googl2 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException, IOException {
        // TODO code application logic here
        int t;
        int result;
        String input1;
        String input2;
        String input4;
        int a,b;
       File input=new File("C:\\Users\\Mimo\\Desktop\\C-small-attempt0.in");
            FileWriter output=new FileWriter("output.txt");
        BufferedWriter out = new BufferedWriter(output);
        Scanner getter =  new Scanner(input);
            t=getter.nextInt();
            getter.nextLine();
            for(int i=1;i<=t;i++)
            {
                result=0;
               input1=getter.next();
               input2=getter.next();
               a=Integer.valueOf(input1);
               b=Integer.valueOf(input2);
               for(int j=a;j<b;j++)
               {
                   input4=String.valueOf(j);
                  for(int jj=0;jj<input4.length()-1;jj++)
                  {
                     input4=input4.substring(input4.length()-jj-1)+input4.substring(0, input4.length()-jj-1);
                      if(Integer.valueOf(input4)<=b  && Integer.valueOf(input4)>j && input4.charAt(0)!='0')
                         result++;
                      System.out.println(input4+" "+" "+b+" "+result+" "+j);
                      input4=String.valueOf(j);
                  }
               }
               
                out.write("Case #"+i+": "+result);
       out.newLine();
            }
            out.close();
        
    }
}
