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

import java.util.ArrayList;

public class RecycledNumbers {

	public static void recycled(String in,String out){
		InOutTool iot = new InOutTool(in,out);
		ArrayList<String> js = new ArrayList<String>();
		for(int i=1;i<iot.size();i++){
			int count = 0;
			String s = iot.get(i).trim();
			String[] num = s.split(" ");
			int f = Integer.parseInt(num[0]);int l = Integer.parseInt(num[1]);
			int n = f+1;
			while(n<=l){
				String ns = String.valueOf(n);
				if(ns.length()>1){
					ArrayList<String> list = new ArrayList<String>();
					for(int k=ns.length()-1;k>0;k--){
						String temp = ns.substring(k) + ns.substring(0, k);//move
						if(!temp.startsWith("0")){
							int t = Integer.parseInt(temp);
							if(t<n&&t>=f&&(String.valueOf(t).length()==ns.length())&&(!list.contains(String.valueOf(t)))){
									list.add(String.valueOf(t));
									count ++;
							}
						}
					}
				}
				n++;
			}
			js.add("Case #" + i + ": " + count);
		}
		iot.clear();iot.addAll(js);
		System.out.println(iot.outText());
	}
	
	public static void main(String...args){
		RecycledNumbers.recycled("C-large.in", "C-large.out");
	}
}
