/*
 * 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 C
{
    public static int front;

    public static int rotate(int in)
    {
	return (in / 10) + front*(in % 10);
    }

    public static void main(String[] args)
    {
	Scanner in = new Scanner(System.in);

	int T = in.nextInt();

	for(int c = 1; c <= T; c++){
	    int ans = 0;

	    int A = in.nextInt();
	    int B = in.nextInt();

	    int ndig = ("" + A).length();
	    front = 1;
	    for(int i = 1; i < ndig; i++)
		front *= 10;
	    
	    for(int num = A; num <= B; num++){
		int count = 1;
		int rot = rotate(num);
		boolean smallest=true;
		while(smallest &&  rot!= num){
		    if(A <= rot && rot <= B)
			if(rot < num)
			    smallest = false;
			else
			    count++;
		    rot = rotate(rot);
		}
		if(smallest)
		    ans += count*(count - 1)/2;
	    }	

	    System.out.println("Case #" + c + ": " + ans);
	}



    }


}