/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

import java.util.*;

class Recycle
{
  public static int compute(int lowerBound, int upperBound)
  {
    int count = 0;
    int numDigits = 1 + (int)Math.log10(lowerBound);
    int new_num, cut;
    boolean[] check = new boolean[upperBound-lowerBound+1];
    boolean[] check2;
    
    if(lowerBound/10 == 0)
      return 0;
    else
    {
      for(int i = lowerBound; i <= upperBound-2; i++)
      {
        check[i-lowerBound] = true;
        check2 = new boolean[upperBound-lowerBound+1];
        for(int j = 1; j < numDigits; j++)
        {
          cut = i % (int)Math.pow(10,j);
          new_num = cut*(int)Math.pow(10,numDigits-j) + i/(int)Math.pow(10,j);
          if(new_num > i && new_num <= upperBound && !check[new_num-lowerBound] && !check2[new_num-lowerBound])
          {
            check2[new_num-lowerBound] = true;
            count++;
          }
        }
      }
    }
    return count;
  }
  
  public static void main(String[] args)
  {
    Scanner sc = new Scanner(System.in);
    int numCase, lowerBound, upperBound;
    
    numCase = sc.nextInt();
    for(int i = 0; i < numCase; i++)
    {
      lowerBound = sc.nextInt();
      upperBound = sc.nextInt();
      System.out.println("Case #"+(i+1)+": "+compute(lowerBound,upperBound));
    }
  }
}