/*
 * 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.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

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

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

    public static boolean checkNumbers(int n, int m){
        String x=""+n;
        String y=""+m;
        for (int i=0;i<x.length()-1;i++){
            String temp=""+x.charAt(x.length()-1);
            String rest=x.substring(0,x.length()-1);
            temp+=rest;
            x=""+temp;
            if (temp.equals(y)){
                return true;
            }
        }
        return false;
    }
    
    public static int range(int a, int b){
        int counter=0;
        for (int i=a;i<b;i++){
            for (int j=(i+1);j<=b;j++){
                if (checkNumbers(i, j)==true)
                    counter++;
            }
        }
        return counter;
    }
    
    public static void main(String[] args) throws FileNotFoundException {
        Scanner r=new Scanner(System.in);
        String s=r.nextLine();
        PrintWriter out=new PrintWriter("RecycledNumbers.out");
        int t=Integer.parseInt(s);
        for (int i=0;i<t;i++){
            String start=r.next();
            String end=r.next();
            int number=range(Integer.parseInt((start)), Integer.parseInt(end));
            out.write("Case #"+(i+1)+": "+number+"\n");
            out.flush();
//            System.out.println("Case #"+(i+1)+": "+number);
        }
    }
}
