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


public class C
{
   public static void main(String[] args)
   {
      new C(new Scanner(System.in));
   }

   ArrayList<Integer> makeNice(int v)
   {
      ArrayList<Integer> vs = new ArrayList<Integer>();
      while (v > 0)
      {
         vs.add(v%10);
         v = v/10;
      }
      return vs;
   }

   int changeBack(ArrayList<Integer> val)
   {
      int res = 0;
      int u=1;
      for (int v : val)
      {
         res += v*u;
         u = u*10;
      }
      return res;
   }

   public C(Scanner in)
   {
      int tc = 1;
      int T = in.nextInt();
      while (T-->0)
      {
         int A = in.nextInt();
         int B = in.nextInt();
         int res = 0;
         for (int val=A; val<=B; val++)
         {
            TreeSet<Integer> ts = new TreeSet<Integer>();
            //System.out.println(val);
	//System.out.print(val+":");
	    ArrayList<Integer> vs = makeNice(val);
            for (int u=0; u<vs.size(); u++)
            {
               //System.out.println(vs);
	       if (vs.get(vs.size()-1) != 0)
               {
                  int nv = changeBack(vs);
                  if (nv > val && nv <= B)
                     ts.add(nv);
               }
               Collections.rotate(vs,1);
            }
	    //System.out.println(ts);
            res += ts.size();
	//	System.out.println(ts);
         }
         System.out.printf("Case #%d: %d%n", tc++, res);
      }
   }
}
