
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.*;

class Programa
{
	
public static long procesar(String linea)
{
	String vals[]=linea.split(" ");
	int digitos=vals[0].length();
	long a,b;
	a=Long.parseLong(vals[0]);
	b=Long.parseLong(vals[1]);
	long reciclados=0;
	
	int indi,ind = (int)(b-a+1);
	
	int parejas[][]=new int[ind][ind];
	long t=b-a+1;
	long cal;
	long v,resto,pot;
	String resu,resu2;
/*	for (long =0;l<t;l++) { 
		r[(int)l]=0;
		r[(int)l]=0;
	}*/
	for (long l=a;l<=b;l++)
        {
            ind=(int) (l-a);
   
               for (int k=1;k<digitos;k++)
               {		  
                  pot=(long) Math.pow(10,k);  		       
		  resto=l%pot;
		  v=l/pot;
		  resu=""+resto+v;     
		  cal=Long.parseLong(resu);      
   		  indi=(int) (l-a);
                  ind=(int) (cal-a);		       
	          if (cal>=a && cal<=b && cal!=l && parejas[indi][ind]==0  && parejas[ind][indi]==0 )
                  {
	   //         System.out.println(""+l+" "+cal);
		    parejas[indi][ind]=1;
              	    reciclados++;    		      
	         }
		  
            }	      
	}
	return reciclados;
}

	public static void main(String args[])
  {
  try{

  FileInputStream fstream = new FileInputStream(args[0]);
  
  DataInputStream in = new DataInputStream(fstream);
  BufferedReader br = new BufferedReader(new InputStreamReader(in));
  String strLine;
  strLine = br.readLine();
  int casos=Integer.parseInt(strLine);
  int caso=1; 	  
  long respuesta=0;	
  while ((strLine = br.readLine()) != null)   {
              respuesta=procesar(strLine);
	      System.out.println("Case #"+caso+": "+respuesta);
              caso++;
	  }
  //Close the input stream
  in.close();
    }catch (IOException e){//Catch exception if any
  System.err.println("Error: " + e.getMessage());
  }
  }
}