/*
 * 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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

public class Dancers {

	public void solve() throws FileNotFoundException {
		Scanner in = new Scanner(new File("C-small-attempt1.in"));
		PrintWriter out = new PrintWriter("C-small-attempt1.out");

		int testN = in.nextInt();

		for (int i = 1; i <= testN; i++) {
			out.print("Case #" + i + ": ");
			int a = in.nextInt();
			int b = in.nextInt();
			int recycled = 0;
			StringBuilder sb;

			if (b > 9) {
				for (int x = a; x <= b; x++) {
					sb = new StringBuilder(Integer.toString(x));

					for (int y = 0; y < sb.length() - 1; y++) {
						int v = backToFront(sb);

						recycled += isRecycled(v, x, b);
					}

				}

			}
			out.println(recycled);
		}

		in.close();
		out.close();

	}

	public int backToFront(StringBuilder sb) {

		char c = sb.charAt(sb.length() - 1);

		sb.deleteCharAt(sb.length() - 1);

		sb.insert(0, c);

		int x = Integer.parseInt(sb.toString());

		return x;
	}

	public int isRecycled(int v, int x, int b) {
		int r = 0;

		if (v > x && v <= b)
			for (int i = x; i <= b; i++) {
				if (v == i)
					r++;
			}

		return r;
	}

	public static void main(String[] args) throws FileNotFoundException {
		new Dancers().solve();
	}
}