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.*;
import java.util.*;
public class RecycledNumbers{
	public static void main(String[] args)throws Exception{
	    String file = "C-small-attempt0";
       BufferedReader br = new BufferedReader(new FileReader(file + ".in"));
       FileWriter archivo = new FileWriter(file+".out");
       PrintWriter printer = new PrintWriter(archivo);
       printer.flush();
	   int n,a,b,aux,cont,tamano,auxiliar,cont2;
	   String aux2,aux3,aux4;
	   boolean probar;
	   int []  v = new int[2000000];
	    String []  s = new String[2000000];
	   StringBuffer cadena;
	   StringTokenizer st;
	   String line;
	   line=br.readLine();
	   n=Integer.parseInt(line);
	   for(int i=0;i<n;i++){
	   	cont=0;
	   	cont2=0;
	   	line=br.readLine();
	   	st= new StringTokenizer(line);
	   a=Integer.parseInt(st.nextToken());
	   b=Integer.parseInt(st.nextToken());
	   aux=a;
	   for(int j=0;j<=(b-a);j++){
	   	v[j]=aux;
	   	s[j]=v[j]+"";
	   	aux++;
	   }
	   tamano=s[0].length();
	   probar=true;
	    for(int j=0;j<=(b-a);j++){
	    	String[] arrayletra = s[j].split("");
	    	
	    	for(int e=j+1;e<=(b-a);e++){
	             String[] arrayletra2 = s[e].split("");
	             cont=0;
	             		for(int k=1;k<=tamano;k++){
	             				for(int u=1;u<=tamano;u++){
	             					if(arrayletra[k].equals(arrayletra2[u])){
	             						cont++;
	             						arrayletra2[u]="a";
	             						break;
	             							
	             					}
	              	
	                            }
	             			}
	         if(cont==tamano){
	         	//System.out.println("se cumplio, encontro "+s[e]+" en "+s[j]);
	         	String[] arrayletra3 = s[e].split("");
	         	 aux4="";
	         	 aux3="";
	         	 for(int k=1;k<tamano+1;k++){
	         	 	aux4=s[j].substring (k, tamano); 
	         	    aux3=s[j].substring (0, k); 
	         	 	  aux4=aux4+aux3;
	         	 	  if(aux4.equals(s[e])){
	         	 	  	cont2++;
	         	 	  	break;
	         	 	  }
	         	 }
	         	
	         }
	       
	         }
	   	
	    }
	   printer.println("Case #"+(i+1)+": "+cont2);
	   }
		 br.close();
		printer.close();
        System.exit(0);	
	}
	
}
