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();
	}

}

package y2012.quals;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;

public class C {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner in = new Scanner(new File("C.in"));
		PrintWriter out = new PrintWriter(new File("C.out"));
		int nTestCase = Integer.parseInt(in.nextLine());
		int[] stepeni = { 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000,
				100000000 };
		for (int testCase = 0; testCase < nTestCase; testCase++) {
			int a = in.nextInt();
			int b = in.nextInt();
			int res = a - 1;
			int brCif = 0;
			while (res > 0) {
				brCif++;
				res /= 10;
			}
			HashSet<Integer> hs = new HashSet<Integer>();
			for (int i = a; i <= b; i++) {
				if (i == stepeni[brCif])
					brCif++;
				int tmp = i;
				for (int j = 1; j < brCif; j++) {
					tmp = (tmp % 10) * stepeni[brCif - 1] + tmp / 10;
					if (i < tmp && tmp <= b && !hs.contains(tmp)) {
						res++;
						hs.add(tmp);
					}
				}
				hs.clear();
			}
			out.println("Case #" + (testCase + 1) + ": " + res);
		}
		in.close();
		out.close();
	}

}
