/*
 * 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.
 */
//c prob 
import java.io.*;
import java.util.StringTokenizer;

/**
 *
 * @author abood
 */
public class test {
  static  int count =0,s=0;
    public static void main(String[] args) throws IOException {
        BufferedReader br =new BufferedReader(new FileReader("C-small-attempt0.in"));
   PrintWriter out =new PrintWriter(new BufferedWriter(new FileWriter("C-small-attempt0.out")));
        int loop=Integer.parseInt(br.readLine());
        for (int i = 1; i <=loop; i++) {
            count=0;
            StringTokenizer st=new StringTokenizer(br.readLine());
           int x=Integer.parseInt(st.nextToken());
           int y=Integer.parseInt(st.nextToken());
            for (int j = x; j < y; j++) {
                check(j,y);
            }
      out.println("Case #"+i+": "+count);
        }
        out.close();                                  // close the output file
    System.exit(0);  
    }
    public static void check(int xx,int yy){
        String res="";
        String x=""+xx;
        int l=x.length();
        String t="";
        for (int i = 1; i < l; i++) {
            t=x.substring(i, l)+x.substring(0,i);
            int m=Integer.parseInt(t);
            if(m<=yy&&m>xx){
               // System.out.println(xx+" "+t);
                if(res.contains(t))continue;
                res+=" "+t;
                count++;
                }
            
        }
    }
}
