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

public class RecycledNumbers
{
    static String moveToFront (String nStr, int size){
        return nStr.substring(nStr.length()-size, nStr.length()) + nStr.substring( 0, nStr.length() - size);
    }
    static boolean isRecycle (int n, int m){
        String nStr = Integer.toString( n );
        String mStr = Integer.toString( m );
        for (int size = 1; size < nStr.length(); size++){
            if (moveToFront(nStr,size).equals(mStr))
                return true;
        }
        return false;
    }
    static HashMap<Integer, LinkedList<Integer>> possibleNM (int a, int b)
    {
        String bStr = Integer.toString( b );
        HashMap<Integer,LinkedList<Integer>> map = new HashMap<Integer,LinkedList<Integer>>();
        for ( int i = a; i < b; i++){
            LinkedList<Integer> list = new LinkedList<Integer>();
            if ( Integer.toString(i).length() > bStr.length())
                break;
            for ( int j = i + 1; j <= b; j++)
                list.add( j );
            map.put( i, list);
        }
        return map;
    }
    public static void main (String[] args) throws IOException
    {
        BufferedReader reader = new BufferedReader(new FileReader("recycle.in"));
        int T = Integer.parseInt(reader.readLine());
        int output = 0;
        int a,b;
        HashMap<Integer,LinkedList<Integer>> possibleNM;
        LinkedList<Integer> list;
        for ( int i = 0; i < T; i++){
            StringTokenizer st= new StringTokenizer(reader.readLine());
            a = Integer.parseInt( st.nextToken() );
            b = Integer.parseInt( st.nextToken() );
            possibleNM = possibleNM(a,b);
            for ( int j = a; j <b; j++){
                try{
                    list = possibleNM.get(j);
                    for (int k = 0; k < list.size(); k++){
                        //if (j == 146 && list.get(k) == 461)
                            //System.out.println("j = " + j);
                        if ( isRecycle(j,list.get(k))){
                            //System.out.println(j+","+list.get( k ));
                            output++;
                        }
                    }
                }
                catch (NullPointerException e){
                }
            }
            System.out.println("Case #" +(i+1) + ": " + output);
            output = 0;
        }   
    }
}