import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t=sc.nextInt();
		int casos=1, a, b, n, m, cont;
		while(t!=0){
			a=sc.nextInt();
			b=sc.nextInt();
			if(a>b){
				int aux=a;
				a=b;
				b=aux;
			}
			System.out.printf("Case #%d: ",casos++);
			if(a==b){
				System.out.printf("%d\n",0);
			}else{
				cont=0;
				for(n=a;n<b;n++){					
					for(m=n+1;m<=b;m++){					
						if(isRecycled(n,m)) cont++;
					}
				}
				System.out.printf("%d\n",cont);
			}
			t--;
		}		
	}
	public static boolean isRecycled(int n1, int n2){
		String s1, s2, aux;
		s1 =  String.valueOf( n1 );
		s2 =  String.valueOf( n2 );		
		boolean r = false;		
		for(int i=0;i<s1.length();i++){
			aux="";
			aux=s1.substring(i,s1.length())+s1.substring(0,i);
//			System.out.println(aux);
			if(aux.equals(s2)){
				r=true;
				break;
			}
		}		
		return r;
	}
}

import java.util.* ;

public class RecycledNumbers {
	 public static void main(String args[]) throws Exception
	 {
	
	String inFileName = "C:\\Documents and Settings\\kumarxnx.BKNG\\Desktop\\CodeJam\\3\\in"; 
	 String outFileName = "C:\\Documents and Settings\\kumarxnx.BKNG\\Desktop\\CodeJam\\3\\out";

	
	
	 
	 FileReaderWriter fri = new FileReaderWriter(inFileName,FileReaderWriter.READ_MODE) ; 
	 FileReaderWriter fro = new FileReaderWriter(outFileName,FileReaderWriter.WRITE_MODE) ;
	 
	 int inputs = fri.readInt() ;
	 ArrayList <Long> nums ;
	 HashMap map ;
	 long low  ;
	 long high ;
	 
	 for(long i=0 ; i<inputs ; i++)
	 {
		nums =fri.readLongList();
		map = new HashMap() ;
		low = nums.get(0) ;
		high = nums.get(1) ;
	    
		for(long j=low;j<=high;j++)
		{
			getCombination(map,j,low,high) ;	
		}
		
		fro.writeLine("Case #"+(i+1)+": "+map.size()) ;
		
	 }
	 
	 
	 fri.close() ; 
	 fro.close() ;
	 
	 }
	 
	 public static void getCombination(HashMap map , long num , long low , long high)
	 {
		 String str = ""+num ;
		 char [] arr = str.toCharArray() ;
		 int len = arr.length ;
		 
		 long newNum ; 
		 for(int i=1 ; i<=len ; i++)
		 {
			 arr  = shiftByOne(arr) ;
			 if(arr[0]!='0')
			 {
			 newNum = Long.parseLong(new String(arr)) ;
			 if(newNum!=num && newNum>=low && newNum<=high)
		 	    {
				   if ( !
						   ( 
						       map.containsKey(""+num+","+newNum)  || 
						       map.containsKey(""+newNum+","+num)					        
					      )
					   )   
				      {
					   
					   
					   map.put(""+num+","+newNum,null) ;
					   
					
				   }
		    	 }
			 }
		 }
	 }
	 
	 public static char[] shiftByOne(char[] arr) 
	 {
		char c = arr[arr.length - 1] ;
		char cnew [] = new char[arr.length] ;
		 		 
		for(int i=1;i<cnew.length ; i++)
		{
			cnew[i] = arr[i-1] ; 
		}
		cnew[0] = c ;
		return cnew ;
	 }
	 
	
}
