import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.StringTokenizer;


public class jamc {
public static boolean b=false;
public static Scanner in;
public   static PrintWriter out;



static boolean recycle(int i,int j)
{
	String n=""+i+"";
	String m=""+j+"";
	
	for(int k=0;k<n.length();k++)
	{
		
		if(m.equals(n.substring(1)+n.substring(0, 1)))
		{
			return true;
		}
		n=n.substring(1)+n.substring(0, 1);
		
		
	}
	
	
	
	
	return false;
}

	
	public static void ecrire(String s)
	{
		if(b)
		{
			out.println("");
		}
		b=true;
		out.print(s);
		
		
		
	}

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		
         in=new Scanner(new File("C-small-attempt9.in"));
		 out=new PrintWriter("c.out");
	in.nextLine();
	int j=1;
	while(in.hasNext())
	{
		
		int compt=0;
		String s=in.nextLine();
		String resultat="";
		StringTokenizer tk=new StringTokenizer(s);
		String n=tk.nextToken();
		String m=tk.nextToken();
		int nint=Integer.parseInt(n);
		int mint=Integer.parseInt(m);
		for(int par=nint;par<=mint;par++)
		{
			for( int par1=nint;par1<=mint;par1++)
			{
				if(recycle(par,par1)&&(par!=par1))
					compt++;
				
				
			}
			
			
			
		}
		resultat="Case #"+j+": "+compt/2+"";
		ecrire(resultat);
		j++;
		
		
		}
		
		
	
	
	
	
	

	
	
	
	
	
	in.close();
	out.close();

	}

}
