/*
 * 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.io.*;
   import java.util.*;
   
    public class ProblemB {
   
       public static void main(String[] args) throws Exception {
      
         String filename = "C-small-attempt0.in";
         Scanner sc = new Scanner(new File(filename) );
      
         System.setOut(new PrintStream(new FileOutputStream("BSolution.txt")));
         int cases = Integer.parseInt(sc.next());
         sc.nextLine();
         
         for(int l = 1; l <= cases; l++) {
          	  
            int A = sc.nextInt();
            int B = sc.nextInt();
            
            int counter = 0;	
            
            for(int m = B; m > A; m--) {
            
               for(int n = A; n < m; n++) {
               
                  if(isRecycled(n,m))
                     counter++;
               }
            }
         	
            System.out.print("Case #" + l + ": " + counter);
            System.out.println();
         }
      }
       public static boolean isRecycled(int n, int m) {
      
         String str = Integer.toString(n);
      	
         if(Integer.toString(n).length() != Integer.toString(m).length()) 
            return false;
         else {
            for(int k = 1; k < str.length(); k++) {
               String temp = "";
                  
               temp = str.substring(str.length() - k, str.length()) + str.substring(0, str.length() - k);
                 
               if(m == Integer.parseInt(temp))
                  return true;
               
            } 
         }
         return false;
      }
   }