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 com.paupicas.year2012.codejam.qr;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class C {

	public static void main(String[] args) throws Exception {
		String filename = "C-large";
		BufferedReader inputFile = new BufferedReader(new FileReader(filename + ".in"));
		FileWriter outputFile = new FileWriter(filename + ".out");

		int casesNumber = Integer.valueOf(inputFile.readLine());
		for (int cn = 1; cn <= casesNumber; cn++) {
			String result = "Case #" + cn + ": ";

			String[] tn = inputFile.readLine().split(" ");
			int a = Integer.valueOf(tn[0]);
			int b = Integer.valueOf(tn[1]);

			HashMap<String, Boolean> counted = new HashMap<String, Boolean>(b - a);

			int c = 0;
			for (int i = a; i <= b; i++) {
				String is = String.valueOf(i);
				for (int j = 1; j < is.length(); j++) {
					String ps = is.substring(j, is.length()) + is.substring(0, j);
					String pair = is + "," + ps;
					int p = Integer.valueOf(ps);
					if (p > i && p <= b && !counted.containsKey(pair)) {
						c++;
						counted.put(pair, true);
					}
				}
			}

			result = result + c;

			System.out.println(result);
			outputFile.write(result);
			if (cn < casesNumber) {
				outputFile.write("\n");
			}
		}

		inputFile.close();
		outputFile.close();
	}

}
