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

//Shreyas Garg
//sgbasketball3
   import java.io.*;
   import java.util.*;
   import java.lang.*;
   public class Recycle
   {
      public static int count = 0;
      public static int MAX = 0;
      public static int MIN = 0;
      public static Set<Pair> set = new HashSet<Pair>();
      public static void main(String[] args) throws Exception
      {
         Scanner sc = new Scanner(new File("C-small-attempt0.in.txt"));
         PrintStream outfile = new PrintStream(new FileOutputStream("recycle.out.txt"));
         int N = sc.nextInt();
         for(int y = 0; y < N; y++)
         {
            int A = sc.nextInt();
            int B = sc.nextInt();
            MIN = A;
            MAX = B;
            if( A < 10 && B < 10)
               outfile.println("Case #" + (y+1) + ": 0");
            else
            {
               for(int x = A; x < B; x++)
                  findPossibilities(x);
               outfile.println("Case #" + (y+1) + ": " + set.size());
               set = new HashSet<Pair>();
            }
         }
      }
      public static void findPossibilities(int y)
      {
         String s = Integer.toString(y);
         for(int x = 1; x < s.length(); x++)
         {
            String one = s.substring(x);
            String two = s.substring(0,x);
            String com = one + two;
            int temp = i(com);
            com = Integer.toString(temp);
            if(temp > MIN && temp <= MAX && temp > y)
            {
               //System.out.println(s + " " + com);
               count++;
               set.add(new Pair(y,temp));
            }
         }
      
      }
      public static int i(String s)
      {
         return Integer.parseInt(s);
      }
   }
   class Pair
   {
      public int x;
      public int y;
      public Pair(int one, int two)
      {
         x = one;
         y = two;
      }
      public boolean equals(Object z)
      {
         if(hashCode() == z.hashCode())
            return true;
         return false;
      }
      public int hashCode()
      {
         String one = Integer.toString(x);
         String two = Integer.toString(y);
         return (one + two).hashCode();
      }
   }