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

public class c {

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);

		int[][] list = new int[1000][2];
		for (int i=0; i<1000; i++)
			for (int j=0; j<2; j++)
				list[i][j] = -1;

		for (int i=10; i<1000; i++) {
			fill(i,list[i]);
		}

		int numCases = stdin.nextInt();

		for (int loop=1; loop<=numCases; loop++) {

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

			int sum = 0;
			for (int i=A; i<=B; i++) {
				for (int j=0; j<2; j++)
					if (list[i][j] != -1 && list[i][j] <= B)
						sum++;
			}
			System.out.println("Case #"+loop+": "+sum);
		}
	}

	public static void fill(int val, int[] array) {

		if (val < 100) {

			int other = (val%10)*10 + val/10;
			if (other > val)
				array[0] = other;
		}
		else {
			int orig = val;
			int index = 0;
			for (int i=0; i<2; i++) {
				val = (val%10)*100 + val/10;
				if (val > orig) {
					array[index] = val;
					index++;
				}

			}
		}
	}
}