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



import java.io.*;
import java.util.ArrayList;
import java.util.StringTokenizer;

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

/**
 *
 * @author doda
 */
public class RecycledNumbers {

    /**
     * @param args the command line arguments
     */
     public static void main(String[] args) throws FileNotFoundException, IOException {
        // TODO code application logic here
        BufferedReader R=new BufferedReader(new FileReader("C:\\Users\\doda\\Desktop\\C-small.in"));
        PrintWriter P=new PrintWriter(new FileWriter("C:\\Users\\doda\\Desktop\\small.txt"));
        while(R.ready()){
            int t=Integer.parseInt(R.readLine());
            for(int i=0;i<t;++i){
               StringTokenizer s=new StringTokenizer(R.readLine());
               int n=Integer.parseInt(s.nextToken());
               int m= Integer.parseInt(s.nextToken());
               int out=0;String O="Case #"+(i+1)+":";
               for(int j=n;j<m;++j){
                   int numbers[]=diffOrder(j);
                   for(int k=0;k<numbers.length;++k){
                       if(numbers[k]>j && numbers[k]<=m)++out;
                   }
               }
               O+=" "+out;
               P.println(O);
            }
        }
        P.close();
    }
    public static int [] diffOrder(int num){
        String s=""+num;
        ArrayList<Integer> in=new ArrayList<Integer>();
        int re[];
        for(int i=0;i<s.length()-1;++i){
            s=s.charAt(s.length()-1)+""+s.substring(0,s.length()-1);
            int y=Integer.parseInt(s);
            String h=""+y;
            if(h.length()<s.length())y=0;
            if(!in.contains(y))in.add(y);
        }
        re=new int[in.size()];
        for(int i=0;i<in.size();++i){
            re[i]=in.get(i);
        }
        return re;
    }
}
