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());
	}

}

package contest;

import java.io.BufferedReader;

import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.StringTokenizer;
import java.util.Set; 
import java.util.HashSet;

public class RecycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		try {
			
			int T = Integer.parseInt(in.readLine());
			for (int tc = 0; tc<T; tc++) { 
				String testCase = in.readLine();
				StringTokenizer st = new StringTokenizer(testCase); 
				
				int A = Integer.parseInt(st.nextToken()); 
				int B = Integer.parseInt(st.nextToken());
				
				Map<Integer, Set<Integer>> map = new HashMap<Integer, Set<Integer>>();
				
				int count = 0;
				for (int n=A; n<=B; n++) { 
					List<Integer> list = getRecList(n);
					for (int m: list) { 
						if (m<=B && n<m) { 
							if (map.containsKey(n)) {
								if (map.get(n).contains(m)) { 
									//this pair already exists, skip
								}
								else { 
									map.get(n).add(m);
									count++;
								}
								
							} else { 
								Set<Integer> s = new HashSet<Integer>(); 
								s.add(m);
								map.put(n, s);
								count++;
							}
//							System.out.println("(" +n+ "," + m + ")");//testing
						}
					}
				}
				System.out.println("Case #" + (tc+1) + ": " + count);
			}
		} catch (IOException e) {
			e.printStackTrace();
		}

	}
	
	private static List<Integer> getRecList(int n) { 
		List<Integer> ret = new ArrayList<Integer>(); 

		String str = Integer.toString(n);
		
//		System.out.println("processing " + n); //testing
		for (int i = str.length()-1; i>0;i--) { 
			ret.add(Integer.parseInt(str.substring(i, str.length()) + str.substring(0, i)));
//			System.out.println("adding: " + Integer.parseInt(str.substring(i, str.length()) + str.substring(0, i)));//testing
		}
		
		return ret;
	}
	
	

}
