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


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

import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.Vector;

/**
 *
 * @author dectroo
 */
public class Recycled {

    public static Vector<Long> tabl;

    static long[] RotationList(String N) {

        long result[] = new long[N.length() - 1];
        long n = Long.parseLong(N);
        long number = n;
        long start = number;
        int i = 0;
        int numdigits = (int) Math.log10((double) number); // would return numdigits - 1
        int multiplier = (int) Math.pow(10.0, (double) numdigits);


        while (true) {
            long q = number / 10;
            long r = number % 10;

            number = number / 10;
            number = number + multiplier * r;




            if (number == start) {
                break;
            } else {
                result[i] = number;
                i++;
            }
        }



        return result;

    }

    static void ComputePair(long A, long B) {

        long index = A;
        int numbrPair = 0;
        tabl = new Vector<Long>();
        String indexString;
        while (index < B) {

            if (index != 0) {
                indexString = String.valueOf(index);
                long result[] = RotationList(indexString);
                for (int i = 0; i < result.length; i++) {
                    /*
                     * if(tabl.contains(new Long(result[i]))){
                     *
                     * }
                     */
                    if (index < result[i] && result[i] <= B) {
                        tabl.add(new Long(result[i]));
                        //System.out.println(result[i]);
                    }
                }
            }
            index++;
        }


    }

    public static void main(String[] args) throws IOException {
        // TODO Auto-generated method stub
        Scanner in = new Scanner(new File("test.in"));
        PrintWriter out = new PrintWriter("recycled.out");



        /*
         * for(int i=0;i<result.length;i++){ System.out.println(result[i]);
        }
         */



        int n = in.nextInt();
        int A = 0;
        int B = 0;
        in.nextLine();
        for (int i = 0; i < n; i++) {
            A = in.nextInt();
            B = in.nextInt();
            ComputePair(A, B);
            Object result[] = tabl.toArray();
            out.print("Case #"+(i+1)+": ");
            out.println(result.length);
        }
        in.close();
        out.close();
    }
}
