/*
 * 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.LinkedList;
import java.util.Scanner;
public class problemC
{
    static final int until = 1000;
    static LinkedList<Integer> res[] = new LinkedList[until+1];
    static Object speed[][] = new Object[until+1][];
    public static void main(String []args)
    {
        for(int i=1;i<=until;i++)
            GO(i);
        for(int i=1;i<=until;i++)
            speed[i] = res[i].toArray();
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        for(int num=1;num<=N;num++)
        {
            int ret = 0;
            int A = scanner.nextInt();
            int B = scanner.nextInt();
            for(int i=A;i<=B;i++)
            {
                int len = res[i].size();
                for(int j=0;j<len;j++)
                    if(((Integer)speed[i][j])<=B)
                        ret++;
            }
            System.out.println("Case #"+num+": "+ret);
        }
    }
    public static void GO(int num)
    {
        res[num] = new LinkedList<Integer>();
        String str = Integer.toString(num);
        int len = str.length();
        for(int i=0;i<len;i++)
        {
            str = str.substring(1,len)+str.charAt(0);
            int rev = new Integer(str);
            if(!res[num].contains(rev) && rev>num)
                res[num].add(rev);
        }
    }
}
