import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}

package reusable;

import java.io.IOException;
import java.nio.charset.Charset;
import java.nio.file.Files;
import java.nio.file.Paths;
import java.util.ArrayList;
import java.util.List;

public abstract class CodeJamBase {
	private final List<String> inputLines;
	private final String filename;
	private int testCases;
	private int index = 0;

	public CodeJamBase(String filename) {
		this.filename = (filename != "") ? filename : "sample";

		try {
			inputLines = Files.readAllLines(Paths.get("data/" + this.filename + ".in"), Charset.defaultCharset());
		} catch (IOException e) {
			throw new RuntimeException("Failed to read file: '" + this.filename + "'");
		}

		setup();
	}

	protected void setup() {
		setTestCases(nextInt());
	}

	protected abstract String solution();

	public void run() {
		long startTime = System.currentTimeMillis();

		List<String> outputLines = new ArrayList<>();

		for (int i = 0; i < testCases; i++) {
			String outputLine = "Case #" + (i + 1) + ": " + solution();
			outputLines.add(outputLine);
			System.out.println(outputLine);
		}

		try {
			Files.write(Paths.get("data/" + filename + ".out"), outputLines, Charset.defaultCharset());
		} catch (IOException e) {
			throw new RuntimeException("Failed to write file: '" + filename + "'");
		}

		System.out.println();
		System.err.println("Total run time: " + ((System.currentTimeMillis() - startTime) / 1000d) + "s");
	}

	protected final String nextString() {
		return inputLines.get(index++);
	}

	protected final int nextInt() {
		return Integer.parseInt(nextString());
	}

	protected final String[] nextStringArray() {
		return inputLines.get(index++).split(" ");
	}

	protected final int[] nextIntArray() {
		String[] items = nextStringArray();

		int[] result = new int[items.length];

		for (int i = 0; i < items.length; i++) {
			result[i] = Integer.parseInt(items[i]);
		}

		return result;
	}

	public final void setTestCases(int testCases) {
		this.testCases = testCases;
	}
}
