/*
 * 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.Scanner;
import java.util.ArrayList;
public class RecycledNo
{
  private Scanner input = null;
  private PrintWriter output = null;
  private int numOfCases;
  int getNextCount=0;
  ArrayList<String> al = new ArrayList<String>();
  public static void main(String[] args)
  {
    RecycledNo myRecycle = new RecycledNo();
//    for (int i=1;i<=12;i++)
//    {
//      System.out.println(myRecycle.getNext(1,10));
//    }
    //System.out.println(myRecycle.recycle("123456789",5));
    try
    {
      myRecycle.solve();
    }
    catch(IOException ioe)
    {
      System.out.println("oops");
      System.exit(0);
    }
  }
  public int getNext(int a, int b)
  {
    getNextCount=getNextCount+1;
    if(a+getNextCount-1<=b)
      return a+getNextCount-1;
    else
      return -1;
  }
  public int recycle(String numString, int loc) //recycled part begins with loc, including. Use 1,2,3 as index, excluding 0
  {
    String newNumString = numString.substring(loc-1)+numString.substring(0,loc-1);
    try
    {
      return Integer.parseInt(newNumString);
    }
    catch(NumberFormatException NFE)
    {
      System.out.println("wrong format");
    }
    return -1;
  }
  public void solve() throws IOException
  {
    input = new Scanner(new File("C-small-attempt0.in"));
    output = new PrintWriter("output.txt");
    numOfCases = input.nextInt();
    for (int i = 1; i <= numOfCases; i++)
    {
      int min=input.nextInt();
      int max=input.nextInt();
      int count = 0;
      for(int j = 1; j<=max-min+1;j++)
      {
        int nextInt=getNext(min,max);
        String s = ""+nextInt;
        
        for (int k = 2; k<=s.length();k++) //loop for a specific getNext()
        {
          
          if (s.charAt(k-1)=='0')
            continue;
          
          
          if((recycle(s,k)<=max)&&(recycle(s,k)>=min)&&(recycle(s,k)>nextInt)&&(!al.contains(""+recycle(s,k))))
          {
            count = count + 1;
            //System.out.println(s+" "+recycle(s,k));
          }
          al.add(""+recycle(s,k));
        }
        al.clear();
      }
      output.println("Case #"+i+": "+count);
      getNextCount=0;
    }
    output.close();
    input.close();
  }
}