/*
 * Problem C. Recycled Numbers
 * 
 * Do you ever become frustrated with television because you keep seeing the
 * same things, recycled over and over again? Well I personally don't care about
 * television, but I do sometimes feel that way about numbers.
 * 
 * Let's say a pair of distinct positive integers (n, m) is recycled if you can
 * obtain m by moving some digits from the back of n to the front without
 * changing their order. For example, (12345, 34512) is a recycled pair since
 * you can obtain 34512 by moving 345 from the end of 12345 to the front. Note
 * that n and m must have the same number of digits in order to be a recycled
 * pair. Neither n nor m can have leading zeros.
 * 
 * Given integers A and B with the same number of digits and no leading zeros,
 * how many distinct recycled pairs (n, m) are there with A â¤ n < m â¤ B?
 * 
 * Input
 * 
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing the integers A
 * and B.
 * 
 * Output
 * 
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1), and y is the number of recycled pairs (n, m)
 * with A â¤ n < m â¤ B.
 * 
 * Limits
 * 
 * 1 â¤ T â¤ 50.
 * 
 * A and B have the same number of digits.

Small dataset

1 â¤ A â¤ B â¤ 1000.

Large dataset

1 â¤ A â¤ B â¤ 2000000.

Sample


Input 
 	
Output 
 
4
1 9
10 40
100 500
1111 2222
Case #1: 0
Case #2: 3
Case #3: 156
Case #4: 287
 */

package google.codejam.y2012.qualifications;

import google.codejam.commons.Utils;

import java.io.IOException;
import java.util.StringTokenizer;

/**
 * @author Marco Lackovic <marco.lackovic@gmail.com>
 * @version 1.0, Apr 14, 2012
 */
public class RecycledNumbers {

	private static final String INPUT_FILE_NAME = "C-large.in";
	private static final String OUTPUT_FILE_NAME = "C-large.out";

	public static void main(String[] args) throws IOException {
		String[] input = Utils.readFromFile(INPUT_FILE_NAME);
		String[] output = new String[input.length];
		int x = 0;
		for (String line : input) {
			StringTokenizer st = new StringTokenizer(line);
			int a = Integer.valueOf(st.nextToken());
			int b = Integer.valueOf(st.nextToken());
			System.out.println("Computing case #" + (x + 1));
			output[x++] = "Case #" + x + ": " + recycledNumbers(a, b);
		}
		Utils.writeToFile(output, OUTPUT_FILE_NAME);
	}

	private static int recycledNumbers(int a, int b) {
		int count = 0;
		for (int n = a; n < b; n++) {
			count += getNumGreaterRotations(n, b);
		}
		return count;
	}

	private static int getNumGreaterRotations(int n, int b) {
		int count = 0;
		char[] chars = Integer.toString(n).toCharArray();
		for (int i = 0; i < chars.length; i++) {
			chars = rotateRight(chars);
			if (chars[0] != '0') {
				int m = Integer.valueOf(new String(chars));
				if (n == m) {
					break;
				} else if (n < m && m <= b) {
					count++;
				}
			}
		}
		return count;
	}

	private static char[] rotateRight(char[] chars) {
		char last = chars[chars.length - 1];
		for (int i = chars.length - 2; i >= 0; i--) {
			chars[i + 1] = chars[i];
		}
		chars[0] = last;
		return chars;
	}

}

//RECYCLED NUMBERS

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;

//Importing classes / interface from java.io pacckage to work with files

public class RecycledNumbers
{
	static boolean checkForNewM(long temp , long [] m , long totalMForThisN)
	{
		for(int i = 0 ; i < totalMForThisN ; i++)
		{
			if(temp == m[i])
			{
				return false;
			}
		}
		
		return true;
	}
	
	public static void main(String[] args)
	{
		try
		{
			// Open the input file
			FileInputStream fistream = new FileInputStream("C-large.in");
			
			// Get the object of DataInputStream
			DataInputStream in = new DataInputStream(fistream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			
			//Create output file
			File file = new File("output.out");
			boolean exist = file.createNewFile();
			
			if (!exist)
			{
				System.out.println("File already exists.");
				System.exit(0);
			}
			
			FileWriter fostream = new FileWriter("output.out");
			BufferedWriter out = new BufferedWriter(fostream);
			
			int counterCases = 0;		//Counter purpose
			
			//Read File Line By Line
			int totalNumberOfCases = 0;
			while ((strLine = br.readLine()) != null)
			{
				if(counterCases == 0)
				{
					//Ignore the first Line for Conversion
					totalNumberOfCases = Integer.parseInt(strLine);
					counterCases++;
					continue;
				}
				
				String[] results = strLine.split(" ");
				
				long A = Long.parseLong(results[0]);
				long B = Long.parseLong(results[1]);
				
				int counter = 0;
				
				for(long n = A ; n < B ; n++)
				{			
					String nTemp = "" + n;
					String mTemp;
					
					int totalMForThisN = 0;
					long [] m = new long [nTemp.length() - 1];
					
					for(int i= (nTemp.length() - 1) ; i >= 0 ; i--)
					{
						mTemp = nTemp.substring(i) + nTemp.substring(0,i);
						
						if(mTemp.startsWith("0"))
						{
							continue;
						}
						else
						{
							long temp = Long.parseLong(mTemp);
							
							if(temp > n && temp <= B)
							{
								if(checkForNewM(temp, m, totalMForThisN))
								{
									m[totalMForThisN] = temp;
									totalMForThisN++;
									counter++;
								}
							}
						}
					}
				}
				// Print the content in the output file
				out.write("Case #" + counterCases + ": " + counter);
				
				if(counterCases < totalNumberOfCases)
				{
					out.write("\n");
				}
				counterCases++;
			}
			//Close the input stream
			in.close();

			//Close the output Stream
			out.close();
		}
		
		catch(Exception e)
		{
			//Catch exception if any
			System.err.println("Error: " + e.getMessage() + " : " + e);
		}
	}
}