/*
 * 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 RecycledNumbers {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int cases = scan.nextInt();
		
		for (int i = 0; i < cases; i++) {
			System.out.print("Case #" + (i + 1) + ": ");
			int bot = scan.nextInt();
			int top = scan.nextInt();
			int count = 0;
			
			for (int a = bot; a <= top; a++) {
				for (int b = a+1; b <= top; b++) {
					if (test(a, b)) count++;
				}
			}
			
			System.out.println(count);
		}
	}

	private static boolean test(int a, int b) {
		String numA = String.valueOf(a);
		String numB = String.valueOf(b);
		if (numA.length() != numB.length()) return false;
		
		char refA = numA.charAt(0);
		for (int i = 0; i < numA.length(); i++) {
			char currB = numB.charAt(i);
			if (currB == refA) {
				String compare = numB.substring(i) + numB.substring(0, i);
				if (compare.equals(numA)) return true;
			}
		}
		
		return false;
	}
}
