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 java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Locale;
import java.util.MissingResourceException;
import java.util.ResourceBundle;


public class Recycled {

	private static String FileNameFrom = "";
	private static String FileNameTo = "";
	
	/**
	 * @param args
	 */
	
	private int calculate(int n, int m){
		HashSet<String> pairsTest = null;
		int totalPairs = 0;
		String n_Str = null;
		int n_Length = 0;
		for(int i_n = n; i_n < m; i_n++){
			n_Str = String.valueOf(i_n);
			//System.out.println(n_Str);
			n_Length = n_Str.length();
			int afterShift = 0;
			pairsTest = new HashSet<String>();
			for(int move_n = 1; move_n<n_Length; move_n++){
				afterShift = getShifted(i_n,move_n);
				
				//System.out.println(afterShift);
				if((afterShift>i_n)&&(afterShift <= m)){
					if(!pairsTest.contains(i_n + "   " + afterShift)){
						pairsTest.add(i_n + "   " + afterShift);
						totalPairs = totalPairs + 1;
					}
					else{
						//System.out.println(i_n + "   " + afterShift);
					}
					
				}
			}
			pairsTest = null;
		}
		
		return totalPairs;
	}
	
	private int getShifted(int n,int moveToLast){
		
		StringBuffer n_SB = new StringBuffer();
		char[] moveThisPart = new char[moveToLast];
		n_SB.append(n);		
		n_SB.getChars(0, moveToLast, moveThisPart, 0);
		n_SB.delete(0, moveToLast);
		n_SB.append(moveThisPart);
		return Integer.valueOf(n_SB.toString());
	}
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		Recycled rec = new Recycled();
		
		rec.loadPropertiesFile("recycle");
		int testCaseNumber = 0;
		BufferedReader input = null;
		BufferedWriter bufferedWriter = null;
		String line = null;
		try {
			input =  new BufferedReader(new FileReader(FileNameFrom));
			bufferedWriter = new BufferedWriter(new FileWriter(FileNameTo));
			line = input.readLine();
			testCaseNumber = Integer.parseInt(line);
			
			for(int k =0;k<testCaseNumber;k++){
				line = input.readLine();
				line.trim();
				int i = line.lastIndexOf(" ");
				
				int iFirstSpace = line.indexOf(" ");
				//System.out.println(line.substring(0,iFirstSpace)+"  "+line.substring(i+1));
				
				String nStr = line.substring(0,iFirstSpace);
				String mStr = line.substring(i+1);
				
				int n = Integer.parseInt(nStr);
				int m = Integer.parseInt(mStr);
				
				int getR = rec.calculate(n, m);
				//System.out.println("test "+ getR);
				String str = "Case #"+(k+1)+": "+getR;
				//System.out.println(str);
				
				bufferedWriter.write(str);
				bufferedWriter.newLine();
				
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} finally {
            //Close the BufferedWriter
            try {
                if (bufferedWriter != null) {
                    bufferedWriter.flush();
                    bufferedWriter.close();
                }
                
                if(input != null){
					input.close();
				}
            } catch (IOException ex) {
                ex.printStackTrace();
            }
        }
		
	}

	
	private void loadPropertiesFile(String name){
		ClassLoader loader = this.getClass().getClassLoader();
		final ResourceBundle rb = ResourceBundle.getBundle (name,
                Locale.getDefault (), loader);
		
		try{
			FileNameFrom = rb.getString("FileNameFrom");
			FileNameTo = rb.getString("FileNameTo");
			
		}catch(MissingResourceException mRE){
			System.out.println("Input proper keys in the properties file");
			System.exit(0);
		}
	}
}
