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

public class mains {
	public static void main(String[] args) {
		BufferedReader input;
		BufferedWriter output;
		
		try {
			input = new BufferedReader(new FileReader("C-small-attempt0.in"));
			output = new BufferedWriter(new FileWriter("output.out"));
			
			int caseCount = Integer.parseInt(input.readLine());
			
			String buf;
			String[] values;
			int minValue;
			int maxValue;
			int currentValue;
			int highest;
			int next;
			int result = 0;
			int numLength;
			
			for(int index = 1 ; index <= caseCount; ++index) {
				buf = input.readLine();
				values = buf.split(" ");
				
				minValue = Integer.parseInt(values[0]);
				maxValue = Integer.parseInt(values[1]);
				
				numLength = values[1].length();
				highest = (int)Math.pow(10, numLength - 1);
				result = 0;
				if(highest != 1) {
					for(int num = minValue; num <= maxValue ; ++num) {
						currentValue = num;
						for(int i = 0 ; i < numLength ; ++i) {
							next = currentValue / highest;
							currentValue %= highest;
							currentValue *= 10;
							currentValue += next;
							
							if(num < currentValue && currentValue <= maxValue)
								++result;
						}
					}
					
					output.write("Case #" + index + ": " + result);
					output.newLine();
				} else {
					output.write("Case #" + index + ": 0");
					output.newLine();
				}
			}
			
			output.close();
			input.close();
		} catch(Exception e) {
			return;
		}
	}
}
