package fixjava;

public class StringUtils {

	/** Repeat the given string the requested number of times. */
	public static String repeat(String str, int numTimes) {
		StringBuilder buf = new StringBuilder(Math.max(0, str.length() * numTimes));
		for (int i = 0; i < numTimes; i++)
			buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the left hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padLeft(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(padChar);
		for (int i = 1, mi = bufSize - str.length(); i < mi; i++)
			buf.append(padChar);
		buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the right hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padRight(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(str);
		buf.append(padChar);
		while (buf.length() < bufSize)
			buf.append(padChar);
		return buf.toString();
	}

	/** Intern all strings in an array, skipping null elements. */
	public static String[] intern(String[] arr) {
		for (int i = 0; i < arr.length; i++)
			arr[i] = arr[i].intern();
		return arr;
	}

	/** Intern a string, ignoring null */
	public static String intern(String str) {
		return str == null ? null : str.intern();
	}

}

import java.util.Scanner;


public class C {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        for (int i = 0; i < t; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            int count = 0;
            
            int digits = 0;
            int max = 1;
            int ac = a;
            while(ac > 0) {
                ac /= 10;
                digits++;
                max *= 10;
            }
            int min = max / 10;
            ac = a;
            
            for (int j = a; j < b; j++) {
                if (j == max) {
                    digits++;
                    max *= 10;
                    min *= 10;
                }
                count += getNumPair(j, b, digits, min);
            }
            System.out.println("Case #" + (i+1) + ": " + count);
            
        }
    }

    static final int[] temp = new int[10];
    
    private static int getNumPair(int i, int b, int digits, int min) {
        int ac = i;
        int numKouho = 0;
        int count = 0;
        ddd: for (int k = 0; k < digits - 1; k++) {
            i = i % min * 10 + i / min;
            if (ac < i && i <= b) {
                for (int j = 0; j < numKouho; j++) {
                    if (temp[j] == i) continue ddd;
                }
                temp[numKouho++] = i;
                count++;
            }
        }
        return count;
    }

}
