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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;

public class Main3 
{
	static HashMap<String,String> pairsMap = new HashMap<String,String>();
	
	protected static String resolveTestCase(String line)
	{
		String [] tokens = line.split(" ");
		
		int A = Integer.parseInt(tokens[0]);
		int B = Integer.parseInt(tokens[1]);
		
		System.out.println("A = " + A + " B = " + B );
		
		int pairs = 0;
		
		pairsMap.clear();
		
		for ( int n = A; n <= B; n++ )
		{
			String test = Integer.toString(n);
			
			for ( int j = 1; j < test.length(); j++ )
			{
				String test2 = test.substring(j, test.length()) + test.substring(0, j);
				
				int m = Integer.parseInt(test2);
				
				if ( test2.charAt(0) != '0' && n < m && m <= B && pairsMap.get(test+test2) == null)
				{
					pairs++;
					
					pairsMap.put(test+test2, "");
				}
			}
		}
		
		return "" + pairs;
	}
	
	public static void main (String [] args) throws IOException
	{
		String inputFile = args[0];
		
		File f = new File(inputFile);
		FileReader fr = new FileReader(f);
		BufferedReader br = new BufferedReader(fr);
		
		File f2 = new File(inputFile + ".out");
		FileWriter fw = new FileWriter(f2);

		String line = br.readLine();
		
		int count = Integer.parseInt(line);

		// resolve test cases
		int testcase = 1;
		
		for(int tests = 0; tests < count; tests++)
		{
			line = br.readLine();
			
			System.out.println(line);

			String output = "Case #"+testcase+": ";
			
			output += resolveTestCase(line);
			
			System.out.println(output+"\n");
			fw.write(output+"\r\n");
			
			testcase++;
		}
		
		fw.close();
		
	}
}
