/*
 * 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.IOException;
import java.util.List;

public class StoreCredit extends JamProblem {
    public static void main(String[] args) throws IOException {
        StoreCredit problem= new StoreCredit();
        problem.go();
    }

    @Override
    String solveCase(JamCase jamCase) {
        StoreCreditCase cas = (StoreCreditCase) jamCase;
        for (int i=0; i<cas.itemCount; i++) {
            for (int j=0; j<cas.itemCount; j++) {
                if (i==j) {
                    continue;
                }
                if (cas.prices[i] + cas.prices[j] == cas.credit) {
                    return "" + (i+1) + " " + (j+1);
                }
            }
        }
        throw new RuntimeException();
    }

    @Override
    JamCase parseCase(List<String> file, int line) {
        StoreCreditCase cas = new StoreCreditCase();
        String fist =  file.get(line);
        String second =  file.get(line+1);
        String third =  file.get(line+2);
        cas.credit= Integer.parseInt(fist);
        cas.lineCount = 3;
        cas.itemCount = Integer.parseInt(second);
        cas.prices = JamUtil.parseIntList(third, cas.itemCount);
        return cas;
    }
}

class StoreCreditCase extends JamCase {
    int itemCount;
    int[] prices;
    public int credit;
}
