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.elbr.codejam2012.qualification.C;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.net.URL;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;

public class Recycle {
	private static int a = 0;

	private static int b = 0;

	private static boolean debug = false;

	private static HashSet<String> set = new HashSet<String>();

	private static void isRecycled(int i) {
		String s = i + "";

		LinkedList<String> l = new LinkedList<String>();
		for (int j = 0; j < s.length(); j++) {
			l.add(s.charAt(j) + "");
		}

		for (int j = 0; j < s.length(); j++) {
			String zs = listToString(l);

			if (debug) {
				System.out.println(zs);
			}

			int z = Integer.parseInt(zs);

			if ((z >= a) && (z <= b) && (z > i)) {
				set.add("{" + i + "," + z + "}");
			}

			l.add(l.getFirst());
			l.removeFirst();
		}
	}

	private static String listToString(List<String> l) {
		return l.toString().replace("[", "").replace("]", "").replace(" ", "")
				.replace(",", "");
	}

	public static void main(String[] in) throws IOException {
		String fileName = "C-large.in";
		URL file = Recycle.class.getResource(fileName);
		String path = file.getFile();
		BufferedReader reader = new BufferedReader(new FileReader(path));

		File fileOut = new File(fileName + ".out");
		fileOut.createNewFile();
		BufferedWriter writer = new BufferedWriter(new FileWriter(fileOut));

		int numOfCases = Integer.parseInt(reader.readLine());

		for (int t = 0; t < numOfCases; t++) {
			String line = reader.readLine();

			String outputLine = "Case #" + (t + 1) + ": " + result(line);

			System.out.println(outputLine);

			writer.write(outputLine + System.getProperty("line.separator"));
		}

		reader.close();
		writer.close();
	}

	private static int result(String line) {
		String[] params = line.split("\\s");
		a = Integer.parseInt(params[0]);
		b = Integer.parseInt(params[1]);

		set.clear();

		for (int i = a; i <= b; i++) {
			isRecycled(i);
		}

		return set.size();
	}
}
