package it.simone.google.code.jam2012;

import java.util.HashSet;
import java.util.Set;

public class RecycledNumber implements GoogleCodeExercise {

	int a = 0;
	int b = 0;
	Set<Couple> distinctCouple = null;
	long maxTime = 0;

	private class Couple {
		int x = 0;
		int y = 0;

		public Couple(int x, int y) {
			this.x = x;
			this.y = y;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + x;
			result = prime * result + y;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Couple other = (Couple) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (x == other.x && y == other.y)
				return true;
			if (x == other.y && y == other.x)
				return true;
			return false;
		}

		private RecycledNumber getOuterType() {
			return RecycledNumber.this;
		}

	}

	@Override
	public String execute(String line) {
		int result = 0;

		String[] data = line.split(" ");
		a = Integer.parseInt(data[0]);
		b = Integer.parseInt(data[1]);
		initialize();

		int n = a;
		//
		while (n <= b) {
			result += analize(n);
			n++;
//			if (n % 1000 == 0)
//				System.out.println(n);
		}

		System.out.println(result);
		return "" + result;
	}

	@Override
	public void initialize() {
		distinctCouple = new HashSet<Couple>();
	}

	private int analize(int number) {
		String numString = "" + number;
		initialize();
		for (int i = 1; i < numString.length(); i++) {
			int m = shift(numString, i);
			if (a <= number && number < m && m <= b) {
				Couple couple=new Couple(number,m);
				if (!distinctCouple.contains(couple))
					distinctCouple.add(couple);
			}
		}
		return distinctCouple.size();
	}

	private int shift(String numString, int posx) {

		String result = null;
		result = "" + numString.substring(posx) + numString.substring(0, posx);

		return Integer.parseInt(result.toString());
	}

}

/**
 * 
 */

import hack.PolynomialFactoring;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;

/**
 * http://code.google.com/codejam/contest/dashboard?c=1460488#s=p2 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.
 * 
 * @author y
 */
public class RotateNumbers {

	/**
	 * 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?
	 * 
	 * @param min
	 * @param max
	 */
	static int pairsRotated  (int min, int max){
		if(max<10 || max<=min){return 0;}
		int ret = 0;
		
		for(int j=min; j<max; j++){
			String s = String.valueOf(j);

			HashSet<Integer> set = new HashSet<Integer>();
			
			for(int k=1; k<s.length(); k++){//iterate each digit
				
				//rotate from bigger digit
				if(s.charAt(k)>=s.charAt(0)){ //=212-> 221. ignore repeat, count (12, 21) once
					
					String rotateString = s.substring(k) + s.substring(0, k);	
					
					int rotate = Integer.valueOf(rotateString);
					
					if((j<rotate) && (rotate <=max)){ //rotate>=min
						if(!set.contains(rotate)){
							set.add(rotate);
							ret ++; 
						}						
						//System.out.println(j + "-> " + rotate);
					}
				}
			}
		}
		
		return ret;
	}

	public static void main(String[] args) {
		
		createOutput();

		List<String[]> input = readLine();

		for (int j = 0; j < input.size(); j++) {

			String[] line = input.get(j);
			int n =  Integer.parseInt(line[0]);
			int k =  Integer.parseInt(line[1]);
			int ret = pairsRotated(n, k);

			String outputLine = "Case #" + (j+1) + ": " + ret;
			System.out.println(outputLine);
			writeOutput(outputLine);
		}	

	}
	

	public static List<String[]> readLine(){
		return readLine("input.txt");
	}
	
	public static List<String[]> readLine(String inputFile){
		List<String[]> list = new ArrayList<String[]>();
		//String lineSeparator= System.getProperty("line.separator");
		
		try {
			InputStream stream = PolynomialFactoring.class.getClassLoader().
					getResourceAsStream(inputFile);			
			BufferedReader input = new BufferedReader(new InputStreamReader(stream));//new FileReader(inputFile));
			String line = null; 

			if ((line = input.readLine()) != null) {
			}
			
			try {
				while ((line = input.readLine()) != null) {					
					//logger.info("input: " + line );
					String[] words = line.split(" ");
					
					list.add(words);
					//parse line and run code.

				}
					
			} catch (Exception e) {
				e.printStackTrace();
			} finally {
				input.close();
			}
		} catch (IOException ex) {
			ex.printStackTrace();
		}

		return list;
	}
	

	private static final String OUTPUT_TXT = "./output.txt";

	public static void createOutput() {

		try {
			new FileWriter(OUTPUT_TXT);
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

	public static void writeOutput(String content) {
		BufferedWriter output;
		try {
			output = new BufferedWriter(new FileWriter(OUTPUT_TXT, true));

			try {
				output.write(content + "\r\n");
			} catch (Exception e) {
				e.printStackTrace();
			} finally {
				output.close();
			}
		} catch (IOException e1) {
			e1.printStackTrace();
		}

	}

}
