/*
 * 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.*;
import java.io.*;

public class Recycle
{
  public static void main(String[] args)
  {
    Scanner in = new Scanner(new BufferedInputStream(System.in));
    int T = in.nextInt();
    for(int i=0; i <T;i++)
    {
      int A = in.nextInt();
      int B = in.nextInt();
      
      int x = A;
      int digits = 1;
      while(x >=10)
      {
        x = x/10;
        digits++;
      }
      //System.out.println("digits: " + digits);
      int sum = 0;
      int[] m = new int[digits-1];
      for(int k = 0; k < m.length; k++)
        m[k] = (k+1)*-1;
      
      for(int j = A; j < B; j++) 
      {
        //reset m 
        for(int k = 0; k < m.length; k++)
          m[k] = (k+1)*-1;
        
        //try every possible combination
        //count it if j < combo < B
        for(int k = 1; k < digits; k++)
        {
          int divisor = (int) Math.pow(10,k);
          int multiplier = (int)Math.pow(10,digits-k);
          int temp = (j%divisor)*multiplier + j/divisor;
          
          //if all digits the same skip
          String number = Integer.toString(temp);
          if(number.matches("^([0-9])\\1*$")) continue;
          
          if(temp > j && temp <= B) 
          {
            m[k-1] = temp;
            sum++;
          }
        }
        //if redundancy subtract
        Arrays.sort(m);
        for(int k = 1; k < m.length; k++)
          if(m[k] == m[k-1]) sum--;
      }
      System.out.printf("Case #%d: %d\n",i+1,sum);
    }
  }
}