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

import java.io.File;
import java.io.FileInputStream;
import java.util.Scanner;

/**
 *
 * @author imgps
 */
public class C {
    public static void main(String args[]) throws Exception{
        int A,B;
        int ctr = 0;
        int testCases;
        
        Scanner sc = new Scanner(new FileInputStream("C-small-attempt0.in "));
        testCases = sc.nextInt();
        int input[][] = new int[testCases][2];
        for(int i=0;i<testCases;i++)
        {
          //  System.out.print("Enter input A B: ");
            input[i][0] = sc.nextInt();
            input[i][1] = sc.nextInt();
            
        }
  

for(int k=0;k<testCases;k++){
      ctr = 0;
      A = input[k][0];
      B = input[k][1];
        for(int i = A;i<=B;i++){
            int num = i;
            int nMul = 1;
            int mul = 1; 
            int tnum = num/10;
            while(tnum > 0){
                mul = mul *10;
                tnum= tnum/10;
            }
            tnum = num;
            int n = 0;
            while(tnum > 0 && mul >= 10){
                nMul = nMul * 10;
                n = (num % nMul) * mul + (num / nMul);
                mul = mul / 10;
                tnum = tnum / 10;
                for(int m=num;m<=B;m++){
                    
                    if(n == m && m > num){
                        ctr++;
                    }
                }
                
                
                
         
            }
        }
        System.out.println("Case #"+(k+1)+": "+ctr);
        
    }
    }
}


   import java.util.*;

   public class c{
   
      public static void main(String a[]){
      
         Scanner s = new Scanner(System.in);
         
         int n = s.nextInt();
         int array[] = new int[10];
         s.nextLine();
      	
         for(int N=0 ; N<n ; N++){
         
            int from = s.nextInt();
            int to = s.nextInt();
         
            int  numDigits = (from + "").toCharArray().length;
            int propCount = 0;
         
            for(int i = from ; i < to ; i++){
            	
               int j = 10;
               int dFrom = i; 
               int count = 1; 
               int arrayCount = 0;
            	
               while(dFrom/j > 0){
               
                  int rem = dFrom%j;
                  dFrom = dFrom/j;
                  rem *= Math.pow(10, numDigits - count);
                  dFrom += rem;
                  
                  if(dFrom > i && dFrom <=to) {
                     array[arrayCount++] = dFrom;
                  }
                  
                  ++count;
                  dFrom = i;
                  j *= 10;
               }
               
               Arrays.sort(array,0,arrayCount);
            	
            	outer:
               for(int w=0 ; w< arrayCount; w++){
                  for(int x=w + 1 ; x < arrayCount ; x++){
                    
                     if(array[w] == array[x])
                        continue outer;
                  
                  }
                  
                  ++propCount;
               }
            }   
         	  
            System.out.printf("Case #%d: %d\n", N + 1, propCount);
         }
      }
   }