/*
 * 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.HashSet;
import java.util.Set;

public class Recycled {
    public static void main(String []args)
    {
        int T,counter = 1;
       try {
         BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(new FileOutputStream(new File("output.txt"))));
           String input = reader.readLine();
            T = Integer.parseInt(input);
            while (T-->0)
            {
                input= reader.readLine();
                String []in = input.split(" ");
                int A,B;
                A=Integer.parseInt(in[0]);
                B=Integer.parseInt(in[1]);
                int numPairs = 0;
                for(int i=A;i<=B;i++)
                {
                    Set<Integer> pairs = new HashSet<Integer>();
                    String num = String.valueOf(i);
                    int currentHighestFaceValue = num.charAt(0);
                    for(int j=num.length()-1;j>0;j--)
                    {
                       if(num.charAt(j)=='0')
                        {
                            continue;
                        }
                       if(num.charAt(j)<currentHighestFaceValue)
                        {

                        }
                        else
                        {
                            String poss = num.substring(j) + num.substring(0,j);
                            int possNum = Integer.parseInt(poss);
                            if(possNum<=B && i<possNum)
                            {
                                pairs.add(possNum);
                            }
                        }
                   }
                        numPairs+=pairs.size();
                    }

                writer.write("Case #"+counter+": "+numPairs+"\n");
                counter++;
            }
           writer.flush();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }
}
