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

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package test;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 *
 * @author Jeric Bryle Sy Dy
 */
public class GJamC2 {

	private static class Ref {

		public int cnt;
		public Set<String> set;

		public Ref() {
			cnt = 0;
			set = new HashSet<String>();
		}
	}

	private static void permuteMove(char[] arr, int len, String strN, String strB, Ref ref) {
		int arrLen = arr.length;
		char[] result = new char[arrLen];

		int index = 0;
		for (int i = arrLen - len; i < arrLen; ++i) {
			result[index++] = arr[i];
		}
		for (int i = 0; i < arrLen - len; ++i) {
			result[index++] = arr[i];
		}

		String strCur = new String(result);
		if (strCur.compareTo(strN) > 0 && strCur.compareTo(strB) <= 0 && !ref.set.contains(strCur)) {
			ref.set.add(strCur);
			++ref.cnt;
		}
	}

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new FileReader("C:/Users/Jeric Bryle Sy Dy/Downloads/C-large.in"));
		PrintWriter out = new PrintWriter("C:/Users/Jeric Bryle Sy Dy/Downloads/C-large.out");

		int t = Integer.parseInt(br.readLine());

		for (int tIter = 0; tIter < t; ++tIter) {
			Scanner s = new Scanner(br.readLine());

			int a = s.nextInt();
			int b = s.nextInt();

			Ref ref = new Ref();

			for (int n = a; n < b; ++n) {
				ref.set.clear();
				String strN = String.valueOf(n);
//				permute(strN.toCharArray(), 0, strN, String.valueOf(b), 1, ref);
				for (int len = 1; len < strN.length(); len++) {
					permuteMove(strN.toCharArray(), len, strN, String.valueOf(b), ref);
				}
			}

			s.close();

			out.printf("Case #%d: %d\n", tIter + 1, ref.cnt);
		}

		br.close();
		out.close();
	}
}
