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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {
	final static String FILENAME = "C-large";

	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new FileReader("/home/workshop/Documents/"
				+ FILENAME + ".in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter(
				"/home/workshop/Documents/" + FILENAME + ".out"));
		int T = sc.nextInt();
		sc.nextLine();
		for (int ttt = 0; ttt < T; ttt++) {
			int A = sc.nextInt();
			int B = sc.nextInt();

			int count = 0;
			int digits = new Double(Math.floor(Math.log10(A) + 1)).intValue();
			for (int num = A; num < B; num++) {
				Set<Integer> hs = new HashSet<Integer>();
				for (int lastdigits = 1; lastdigits < digits; lastdigits++) {
					int tailmask = new Double(Math.pow(10, lastdigits))
							.intValue(), headmask = new Double(Math.pow(10,
							digits - lastdigits)).intValue();
					int newnum = num / tailmask + (num % tailmask) * headmask;
					if (num < newnum && !hs.contains(newnum) && newnum <= B) {
						// System.out.println(num + "\t" + newnum);
						count++;
						hs.add(newnum);
					}
				}
				// if (y < z) {
				// System.out.println(num + "\t(1)");
				// count++;
				// }
				// if (x < z || (x == z && x > y)) {
				// System.out.println(num + "\t(2)");
				// count++;
				// }
				// if (x < y && y != z) {
				// System.out.println(num + "\t(3)");
				// count++;
				// }
				// if (x < y && x != z) {
				// System.out.println(num + "\t(4)");
				// count++;
				// }
				// if (x < z || (x == z && x > y)) {
				// int newnum = z * 100 + x * 10 + y;
				// if (newnum <= B) {
				// System.out.println(num + "\t" + newnum + "\t(2)");
				// count++;
				// }
				// }
				// if (x < y || (x == y && y < z)) {
				// int newnum = y * 100 + z * 10 + x;
				// if (newnum <= B) {
				// System.out.println(num + "\t" + newnum + "\t(4)");
				// count++;
				// }
				// }
			}

			bw.write("Case #" + (ttt + 1) + ": " + count);
			bw.newLine();
		}
		bw.close();
		sc.close();
	}
}
