import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

package de.hg.codejam.tasks.numbers.service;

import java.util.HashSet;
import java.util.Set;

public class Calculator {

	private final Set<Integer> overallShifts = new HashSet<>();

	public int calculate(int[] pair) {
		int result = 0;

		int lowerBorder = pair[0];
		int upperBorder = pair[1];

		for (int i = lowerBorder; i <= upperBorder; i++) {
			if (!overallShifts.contains(i)) {
				Set<Integer> shifts = getShifts(i);

				int numberOfValidPairs = countValidPairs(shifts, lowerBorder,
						upperBorder);

				result += numberOfValidPairs;
			}
		}

		return result;
	}

	public static int[] calculate(int[][] pairs) {
		int[] results = new int[pairs.length];

		for (int i = 0; i < pairs.length; i++)
			results[i] = new Calculator().calculate(pairs[i]);

		return results;
	}

	private Set<Integer> getShifts(int number) {
		String n = String.valueOf(number);

		Set<Integer> result = new HashSet<>(n.length());
		result.add(number);

		for (int i = 1; i < n.length(); i++) {
			n = n.substring(n.length() - 1) + n.substring(0, n.length() - 1);

			result.add(Integer.parseInt(n));
		}

		overallShifts.addAll(result);

		return result;
	}

	private int countValidPairs(Set<Integer> numbers, int lowerBorder,
			int upperBorder) {
		int counter = 0;

		Integer[] array = new Integer[numbers.size()];
		numbers.toArray(array);

		for (int i = 0; i < array.length; i++)
			if (array[i] >= lowerBorder && array[i] <= upperBorder)
				for (int j = i + 1; j < array.length; j++)
					if (array[j] >= lowerBorder && array[j] <= upperBorder)
						if (array[i] != array[j]
								&& String.valueOf(array[i]).length() == String
										.valueOf(array[j]).length())
							counter++;

		return counter;
	}

}
