/*
 * 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.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumber {

	/**
	 * @param args
	 * @throws IOException
	 * @throws NumberFormatException
	 */
	public static void main(String[] args) throws NumberFormatException,
			IOException {
		// TODO Auto-generated method stub

		FileInputStream fstream = new FileInputStream("C:\\input.txt");
		DataInputStream in = new DataInputStream(fstream);
		BufferedReader br = new BufferedReader(new InputStreamReader(in));

		int cases = Integer.parseInt(br.readLine());
		String mainOutput = "";

		for (int c = 0; c < cases; c++) {

			StringTokenizer stringTokenizer = new StringTokenizer(br.readLine());

			int a = Integer.parseInt(stringTokenizer.nextToken());
			int b = Integer.parseInt(stringTokenizer.nextToken());
			
			int finalCount = 0;

			int arr[] = new int[b * 2];
			int arr2[] = new int[b * 2];

			for (int n = a; n < b; n++) {

				int TEN = 10;
				int count = Integer.toString(n).length();
				for (int i = 1; i < count; i++) {
					int m = (int) ((n % Math.pow(TEN, i)) * Math.pow(TEN, count
							- i))
							+ (int) (n / Math.pow(TEN, i));
					if (a <= n && n < m && m <= b) {
						// System.out.println(n + " " + m);
						arr[finalCount] = m;
						arr2[finalCount++] = n;
					}
				}
			}
			int count = 0;
			for (int i = 1; i < finalCount; i++) {
				if ((arr2[i] == arr2[i + 1] && arr[i] == arr[i + 1])
						|| (arr2[i - 1] == arr2[i] && arr[i - 1] == arr[i])) {
					count++;
				}
			}
			mainOutput = mainOutput + "Case #"+(c+1)+": "+(finalCount - (count / 2))+"\n";			
		}
		BufferedWriter bw = new BufferedWriter(new FileWriter(new File(
        "C:\\output.txt"), true));
		
		bw.write(mainOutput);
		bw.close();
		
		
		in.close();
	}

}
