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

    public static int recycles(int a, int min, int max) {
	HashSet<Integer> history = new HashSet<Integer>();
	int count = 0;
	int size = ("" + a).length();
	int power = (int)Math.pow(10, size - 1);
	int value = a;
	history.add(a);
	for (int i = 0; i < size; i++) {
	    int digit = value % 10;
	    int next = value / 10 + digit * power;
	    if (history.contains(next)) {
		break;
	    } else if (digit != 0 && next > a && next >= min && next <= max) {
		count++;
	    }
	    value = next;
	    history.add(next);
	}
	return count;
    }

    public static void main(String[] args) throws Exception {
	Scanner input = new Scanner(System.in);
	int lines = Integer.parseInt(input.nextLine().trim());
	for (int i = 0; i < lines; i++) {
	    String[] tokens = input.nextLine().split(" ");
	    int A = Integer.parseInt(tokens[0].trim());
	    int B = Integer.parseInt(tokens[1].trim());
	    int total = 0;
	    for (int j = A; j <= B; j++) {
		total += recycles(j, A, B);
	    }
	    System.out.println("Case #" + (i+1) + ": " + total);
	}
    }

}