/*
 * 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.HashSet;
import java.util.Set;

public class Recycled {
    public static void main(String []args)
    {
        int T,counter = 1;
       try {
         BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(new FileOutputStream(new File("output.txt"))));
           String input = reader.readLine();
            T = Integer.parseInt(input);
            while (T-->0)
            {
                input= reader.readLine();
                String []in = input.split(" ");
                int A,B;
                A=Integer.parseInt(in[0]);
                B=Integer.parseInt(in[1]);
                int numPairs = 0;
                for(int i=A;i<=B;i++)
                {
                    Set<Integer> pairs = new HashSet<Integer>();
                    String num = String.valueOf(i);
                    int currentHighestFaceValue = num.charAt(0);
                    for(int j=num.length()-1;j>0;j--)
                    {
                       if(num.charAt(j)=='0')
                        {
                            continue;
                        }
                       if(num.charAt(j)<currentHighestFaceValue)
                        {

                        }
                        else
                        {
                            String poss = num.substring(j) + num.substring(0,j);
                            int possNum = Integer.parseInt(poss);
                            if(possNum<=B && i<possNum)
                            {
                                pairs.add(possNum);
                            }
                        }
                   }
                        numPairs+=pairs.size();
                    }

                writer.write("Case #"+counter+": "+numPairs+"\n");
                counter++;
            }
           writer.flush();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }
}
