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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class RecycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {

		int NumOfRecPairFound = 0;
		
		
		
        File file = new File("data/C-large.in");
        
        
        try {
            
        	Scanner scanner = new Scanner(file);
            
        	int numOfLines = scanner.nextInt();

        	scanner.nextLine();


        	
        	for (int i = 0; i < numOfLines; i++) {
        	
        		// Start from B down to A
        		// Ass is n is strictly less then m
        		int A = scanner.nextInt();
        		int B = scanner.nextInt();
        		
        		NumOfRecPairFound = 0;

        		// Special case
        		if (A < 10 || B < 10) {
        			System.out.println("Case #" + (i+1) + ": 0");
        			continue;
        		}
        		
        		int rotNumbers[];
        		
        		for (int m = B; m >= A; m--) {
        		
        			// Get all the rotated numbers first, then compare
        			rotNumbers = rotatedNumbers(m);
        			
        			for (int test : rotNumbers) {
        				if (test >= A && test < m) {
        					NumOfRecPairFound++;
        				}
        			}
        		}
        		
        			        		
        		System.out.println("Case #" + (i+1) + ": " + NumOfRecPairFound);
        		
        	}
        	
        	
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }

		
		
	}
	
	public static int[] rotatedNumbers(int number) {
		
		int orgNumber = number;
		
		// If we have a 4 digit number, there are 3 rotations (excluding itself)
		int NumOfRotations = (int)Math.log10(orgNumber);
		int output[] = new int[NumOfRotations];
        int mul = (int) Math.pow(10.0, (double)NumOfRotations);
        

       int i = 0;
        while(true)
        {
              int q = number / 10;
              int r = number % 10;

              number = number / 10;
              number = number + mul * r;

             
              if(number == orgNumber)
                    break;

              output[i++] = number;
        }
        
		
		return output;
	}

}
