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

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

import java.io.*;

/**
 *
 * @author Ulyss
 */
public class GoogleCodeJam_RecyclingNumbers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException, IOException {
        // TODO code application logic here
        
        
        BufferedReader br = new BufferedReader(new FileReader("C-small.in"));
        
        PrintWriter pw = new PrintWriter("C-small.out");
        
        int T = Integer.parseInt(br.readLine());
        
        for(int i = 0; i < T; i++){
        
            int total = 0;
            
            String line = br.readLine();
            
            String[] numbers = line.split(" ");
            
            int A = Integer.parseInt(numbers[0]);
            int B = Integer.parseInt(numbers[1]);
            
            System.out.println(A + " : " + B);
            
            for(int lowIndex = A; lowIndex < B; lowIndex++){
                
                for(int highIndex = lowIndex+1; highIndex <= B; highIndex++){
                    
                    if( isRecycled(lowIndex, highIndex) ){
                        
                        System.out.println(" Yes!!! " + lowIndex + " - " + highIndex);
                        total++;
                    }
                }
            }
            
            pw.print("Case #" + (i+1) + ": " + total);
            if( i < T-1 ){
                
                pw.println();
            }
        }
        
        br.close();
        pw.close();
    }
    
    public static boolean isRecycled(int n, int m){
        
        if( n < 10 ){
            
            return false;
        }
        if( n < 100 ){
            
            if( n % 10 == m / 10 && n / 10 == m % 10 ){
                
                return true;
            }
            else{
                
                return false;
            }
        }
        
        if( n < 1000 ){
            
            String nLine = String.valueOf(n);
            String mLine = String.valueOf(m);
            
            if( ( nLine.charAt(2) == mLine.charAt(0) && nLine.charAt(0) == mLine.charAt(1) && nLine.charAt(1) == mLine.charAt(2) ) ||
                ( nLine.charAt(0) == mLine.charAt(2) && nLine.charAt(1) == mLine.charAt(0) && nLine.charAt(2) == mLine.charAt(1) ) ){
                
                return true;
            }
        }
        
        return false;
    }
    
    
}
