/*
 * 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.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.Scanner;

public class leadingZero {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader read = new BufferedReader(new InputStreamReader(
				System.in));
		String ll;
		ll = read.readLine();
		int a = Integer.parseInt(ll);
		for (int k = 0; k < a; k++) {
			Scanner scn=new Scanner(read.readLine());
			int A = scn.nextInt();
			int B = scn.nextInt();
			
			int[] s = new int[20000000];
			for (int i = A; i <= B; i++) {
				String r = i + "";
				int l = i;
				LinkedList<Integer>list=new LinkedList<Integer>();
				
				for (int j = 0; j < r.length() - 1; j++) {
					int b = l % 10;
					l = l / 10 + (int) Math.pow(10, r.length() - 1) * b;
					if (l > i && !list.contains(l))
					{
						s[l]++;
						list.add(l);
					}
				}
			}
			int sum = 0;
			for (int i = A; i <= B; i++) {
				if (s[i] > 0) {
					sum += s[i];
					//System.out.println(i+"  ..  "+s[i]);
				}
			}
			System.out.println("Case #"+(k+1)+": "+sum);
		}
	}

}
