/*
 * 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.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.io.IOException;

public class Recycle
{
  public static void main(String[] args)
  {
    BufferedReader input = null;
    PrintWriter output = null;
    try
    {
      input = new BufferedReader(new FileReader(args[0]));
      output = new PrintWriter(new FileWriter(args[1]));
    
      String currentLine;
      int lineNumber = -1;
      String[] array = new String[2];
      
      while((currentLine = input.readLine()) != null)
      {
        lineNumber++;
        if(lineNumber>0)
        {
          array = currentLine.split(" ");
          int number1 = Integer.parseInt(array[0]);
          int number2 = Integer.parseInt(array[1]);
          int numberOfCases = 0;
          
          for(int count1=number1; count1<number2; count1++)
          {
            int numberOfPlaces = -1;
            int first = count1;
            while(first > 0)
            {
              first = first/10;
              numberOfPlaces++;
            } // while
            
            for(int count=count1+1; count<=number2; count++)
            {  
              first = count1;
              if(first != count)
              {
                do
                {
                  int d = first % 10;
                  first = first/10;
                  int multiply = (int) Math.pow(10, numberOfPlaces);
                  first = d*multiply + first;
                  if(first == count)
                    numberOfCases++;
    
                }while(first != count1);
            
              } // if
            } // for  
          } // for
          output.println("Case #" + lineNumber + ": " + numberOfCases);
        } // if
      } // while
      
    } // try
    
    catch (Exception exception)
    {
    System.err.println(exception);
    } // catch
    
    finally
    {
      try{ if(input != null) input.close(); }
      catch (IOException exception)
      { System.err.println("Could not close input: " + exception); }
      
      if(output != null)
      {
        output.close();
        if(output.checkError())
          System.err.println("Soemthing went wrong with the output");
      } // if
    } // finally
  } // main
} // class 
      
      