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.FileReader;
import java.io.FileWriter;


public class qc {

	public static void main(String [] args)
	{
		String fileName = "C-large.in";
		try{
			FileReader fr = new FileReader(fileName);
			BufferedReader br = new BufferedReader(fr);
			
			FileWriter fw = new FileWriter("output.txt");
			BufferedWriter bw = new BufferedWriter(fw);
			String line="";
			int count = 0;
			int solution = 0;
			while((line=br.readLine())!=null)
			{					
				if(count == 0)
				{
					count++;
					continue;
				}
				
				String [] sp = line.split(" ");
				int [] range = new int[sp.length];
				for(int i =0; i<range.length; i++)
				{
					range[i] = Integer.parseInt(sp[i]);
				}
								
				for(int i =range[0]; i<=range[1]; i++)
				{
					String temp="" + i;
					int [] numArr = makeDigit(temp);
					for(int j =0; j<numArr.length; j++)
					{						
						if((range[0]<=i) && (i < numArr[j]) && (numArr[j] <= range[1]))
							solution++;
					}
				}
				
				bw.write("Case #"+count+": "+solution+"\n");
				
				solution = 0;
				count++;
			}
			bw.close();
			fw.close();
			br.close();
			fr.close();
			
		}catch(Exception EE){
			EE.printStackTrace();
		}
	}
	
	public static int [] makeDigit(String str)
	{		
		int [] returnArr = new int[str.length()];
		for(int i=0; i<str.length()-1; i++)
		{
			char temp = str.charAt(str.length()-1);
			str = str.substring(0, str.length()-1);
			
			String tempS = "" + temp+str;
			str = tempS;
			returnArr[i] = Integer.parseInt(str);
		}
		
		return returnArr;
	}
}
