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.io.*;
import java.util.*;
import java.util.regex.*;

import static java.lang.Math.*;

public class C {
	public static void main(String[] args) throws Exception {

		Scanner in = (args.length > 0) ? new Scanner(new File(args[0]))
				: new Scanner(System.in);
		int T = in.nextInt();
		for (int zz = 1; zz <= T; zz++) {
			System.err.format("#%d\n", zz);
			System.out.format("Case #%d: ", zz);

			int A = in.nextInt();
			int B = in.nextInt();
			int y = 0;

			Set<String> pairs = new HashSet<String>();

			int D = (int) Math.log10(A);
			long p0 = 10;
			long p1 = (long) Math.pow(10, D);

			for (int d = 1; d <= D; d++) {
				for (long n = A; n <= B; n++) {
					long m = ((n % p1) * p0) + (n / p1);
					if (m > n && m <= B && !pairs.contains(n + ":" + m)) {
						y++;
						pairs.add(n + ":" + m);
					}
				}
				p0 *= 10;
				p1 /= 10;
			}

			System.out.format("%d\n", y);
		}
	}
}
