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.ArrayList;
import java.util.List;


public class RecycledNumbers {

	private int A;
	private int B;
	
	public RecycledNumbers(int A, int B) {
		this.A = A;
		this.B = B;
	}
	
	public int calculate() {
		int result = 0;
		int digitCount = Integer.toString(A).length();
		
		if (digitCount == 1) return 0;
		
		List<String> numbers = new ArrayList<String>();
		for (int i = A; i < B + 1; i++) {
			numbers.add(Integer.toString(i));
		}
		
		for (int i = 0; i < numbers.size(); i++) {
			String number = numbers.get(i);
			
			for (int j = 1; j < digitCount; j++) {
				String reverseNumber = number.substring(j) + number.substring(0, j);
				int reversInt = Integer.parseInt(reverseNumber);
				
				if ((reversInt <= B) && (reversInt > Integer.parseInt(number))) {
//					System.out.println("A(" + A + ") <= " + number + " < " + reverseNumber + " <=B(" + B + ")");
					result++;
				}
			}
		}
		
		return result;
	}
	
	public static List<RecycledNumbers> parseFromFile(List<String> readInput) {
		List<RecycledNumbers> result = new ArrayList<RecycledNumbers>();
		int testCaseCount = Integer.parseInt(readInput.get(0));

		for (int i = 0; i < testCaseCount; i++) {
			String line[] = readInput.get(i + 1).split(" ");

			result.add(new RecycledNumbers(Integer.parseInt(line[0]), Integer.parseInt(line[1])));
		}

		return result;
	}
	
	@Override
	public String toString() {
		return "A = " + A + "; B = " + B;
	}
}
