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

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


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

import java.io.*;
import java.util.logging.Level;
import java.util.logging.Logger;
import java.util.*;
/**
 *
 * @author usuario
 */
public class CodejamC {

    /**
     * @param args the command line arguments
     */
    public static int fun(int a,int b,int i){
      int cont=0,n=0,mod,res=i;
      boolean flag;
      String num=i+"";
      String aux;
      int tmp;
      tmp=num.length();
      while(n<tmp-1){
        flag=false;  
        n++;
        if(res<Math.pow(10,tmp-1))
         flag=true;
        mod=res%10;
        num=""+res;
        if(flag){
             num="0"+res;
        }    
        aux=""+mod;
        aux+=num.substring(0,num.length()-1);
        res=Integer.parseInt(aux);
        
        if(res>i && res<= b){
          cont++;
        }  
       }
      return cont;
    }
    public static void main(String[] args){ 
        int n,a,b,cont=0;
        try {
            System.setIn(new FileInputStream("file.in"));
        } catch (FileNotFoundException ex) {
            Logger.getLogger(CodejamC.class.getName()).log(Level.SEVERE, null, ex);
        }
        Scanner reader=new Scanner(System.in);
        n=reader.nextInt(); 
        for(int i=0;i<n;i++){
          cont=0;  
          a=reader.nextInt();
          b=reader.nextInt();
          for(int j=a;j<=b;j++){
            cont+=fun(a,b,j);  
          }
          System.out.println("Case #"+(i+1)+": "+ cont);
        }
      
    }
}
