/*
 * 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;
	}

}

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


public class recy {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int stat[] = new int [2000001];
		
		StringBuffer output = new StringBuffer();
		 
		try{
			  FileInputStream fstream = new FileInputStream("/Users/iToR/Documents/workspace/CodeJam3/src/C-large.in");
			
			  DataInputStream in = new DataInputStream(fstream);
			  BufferedReader br = new BufferedReader(new InputStreamReader(in));
			  String strLine;
			
			 
			  strLine = br.readLine();
			  int line = (new Integer(strLine)).intValue();
			  
			  int i = 1;
			  
			  
			  
			  
			  while ((strLine = br.readLine()) != null)   {
				 
				  //each case
				  
				 
				  	
					output.append("Case #"+i+": ");
						
					String[] temp;
						 
					/* delimiter */
					String delimiter = " ";
					/* given string will be split by the argument delimiter provided. */
			
					temp = strLine.split(delimiter);
					
					
					int orimin = (new Integer(temp[0])).intValue();
					int min = (new Integer(temp[0])).intValue();
					int max = (new Integer(temp[1])).intValue();
					int count = 0;
					
						 while(min<=max){
							 
							  //try swap
							  String tempStr = ""+min;
							  String oritempStr = ""+min;
							  int oricheck = (new Integer(oritempStr)).intValue();
							  stat[min] = 1;
							  for(int k = 0;k<oritempStr.length()-1;k++){
								  //System.out.println("before:"+ tempStr+"x"+tempStr.length());
								  char first = tempStr.charAt(0);
								  
								  tempStr = tempStr.substring(1,tempStr.length());
								  tempStr+= first;
								  
								  int check = (new Integer(tempStr)).intValue();
								  
								  //System.out.println("after:"+ tempStr+"x"+tempStr.length());
								  if(tempStr.charAt(0)=='0'){
									  
								  }
								  else if(check>0&&check<=max&&check>=orimin){
									  if(check>oricheck){
										  count++;
										 //System.out.println(oritempStr+","+check);
									  }
								  }
								  
							  	}
							  
							  min++;							  
						  }
						 
						 
						
						output.append(count);
						if(i<line){
							output.append("\n");
							
						}			
						i++;
			  
			  
			  }
			  //Close the input stream
			  in.close();
			    }catch (Exception e){//Catch exception if any
			  System.err.println("Error1: " + e.getMessage());
			  }
		//write output
		 	try{
			
			  FileWriter fstream = new FileWriter("result_large.txt");
			  BufferedWriter out = new BufferedWriter(fstream);
			  out.append(output);
			 
			  out.close();
			  }catch (Exception e){
			  System.err.println("Error2: " + e.getMessage());
			  }
	}

}
