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 qualificationRound;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;

public class P3 {
	public static int recycle(int j, int b) {
		int ret = 0;
		String old = Integer.toString(j);
		int size = old.length();
		HashSet<String> app = new HashSet<String>();
		for (int i = 1; i < size; ++i) {
			String tmp = old.substring(i) + old.substring(0, i);
			int num = Integer.parseInt(tmp);			
			if (num <= b && num > j && !app.contains(tmp)) {				
				ret++;
				app.add(tmp);
			}
		}
		return ret;
	}

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("C-large.in"));
		FileWriter fw = new FileWriter("out.txt");
		int t = Integer.parseInt(br.readLine());
		for (int i = 1; i <= t; ++i) {
			String line = br.readLine();
			String A = line.split(" ")[0];
			String B = line.split(" ")[1];
			int a = Integer.parseInt(A);
			int b = Integer.parseInt(B);
			int num = 0;
			for (int j = a; j <= b; ++j) {
				num += recycle(j, b);
			}
			fw.append("Case #" + i + ": " + num + "\n");
		}
		br.close();
		fw.close();
	}
}
