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

public class Main
{

  public static void main(String[] args)
  {
    Scanner in = new Scanner(System.in);
    Integer numCases = Integer.parseInt(in.nextLine());
    
    for (int k = 0; k < numCases; k++)
    {
      Integer num1 = Integer.parseInt(in.next());
      int num2 = Integer.parseInt(in.next());
      int count = 0;
      //ArrayList<Integer> tested = new ArrayList<Integer>();
      
      for (Integer i = num1; i <= num2; i++)
      {
	String number = i.toString();
	for (int j = 1; j < number.length(); j++)
	{
	  
	    String front = number.substring(j);
	    String newNumber = front + number.substring(0, j);
	    
	    Integer result = Integer.parseInt(newNumber);
	    
	    if (result > i && result <= num2)
	    {
	      /*tested.add(result);
	      tested.add(i);
	      System.out.println(result);*/
	      count++; 
	    }
	}
	//tested.add(i);
      }
      System.out.println("Case #"+(k+1)+": "+count);
    }
  }

}