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 CaseSolvers;

import Controller.IO;

public class GooglereseCase extends CaseSolver {

	static Character[] opa;
	static {
		opa = new Character[26];
		opa['a' - 97] = 'y';
		opa['b' - 97] = 'h';
		opa['c' - 97] = 'e';
		opa['d' - 97] = 's';
		opa['e' - 97] = 'o';
		opa['f' - 97] = 'c';
		opa['g' - 97] = 'v';
		opa['h' - 97] = 'x';
		opa['i' - 97] = 'd';
		opa['j' - 97] = 'u';
		opa['k' - 97] = 'i';
		opa['l' - 97] = 'g';
		opa['m' - 97] = 'l';
		opa['n' - 97] = 'b';
		opa['o' - 97] = 'k';
		opa['p' - 97] = 'r';
		opa['q' - 97] = 'z';
		opa['r' - 97] = 't';
		opa['s' - 97] = 'n';
		opa['t' - 97] = 'w';
		opa['u' - 97] = 'j';
		opa['v' - 97] = 'p';
		opa['w' - 97] = 'f';
		opa['x' - 97] = 'm';
		opa['y' - 97] = 'a';
		opa['z' - 97] = 'q';
	}

	StringBuilder line;

	public GooglereseCase(int order, int numberOfLines, IO io) {
		super(order, numberOfLines, io);
	}

	@Override
	public void addLine(String line) {
		this.line = new StringBuilder(line);
	}

	@Override
	public void printSolution() {
		System.err.println("Case #" + getOrder() + ": " + line);
	}

	@Override
	public CaseSolver process() {
		for (int i = 0; i < line.length(); i++) {
			char temp = line.charAt(i);
			if (temp != ' ')
				line.setCharAt(i, opa[temp - 97]);
		}
		return this;
	}

	@Override
	public void initializeVars() {
		// TODO Auto-generated method stub

	}

}
