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

}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

public class ProblemC {

	public static void main(String[] args) throws FileNotFoundException {

		String test = "4\n" + "1 9\n" + "10 40\n" + "100 500\n" + "1111 2222\n";

		Scanner sc = new Scanner(new File("C-small-attempt0.in"));
		int teller = 0;
		int numLines = 0;
		String finalOut = "";
		boolean print = false;

		int n = 0;// smal number
		int m = 0;// big number
		int A = 0; // min number
		int B = 0; // max number

		int S = 0; // answare
		String[] split;

		while (true) {
			String line = sc.nextLine();
			if (teller == 0) {
				numLines = Integer.valueOf(line);
			} else {
				print = true;
				split = line.split(" ");
				A = Integer.valueOf(split[0]);
				B = Integer.valueOf(split[1]);

				for (n = A; n < B; n++) {
					for (m = n + 1; m <= B; m++) {
						S += check(n, m);
					}
				}

			}

			if (print) {

				if (teller == numLines) {
					System.out.println("Case #" + teller + ": " + S);
					finalOut += "Case #" + teller + ": " + S;
					break;
				} else {
					System.out.println("Case #" + teller + ": " + S);
					finalOut += "Case #" + teller + ": " + S + "\n";
				}
				S = 0;

			}
			teller++;
		}

		PrintWriter writer = new PrintWriter(new File("out.txt"));

		writer.print(finalOut);
		writer.close();

	}

	private static int check(int n, int m) {

		String N = "" + n;
		String M = "" + m;
		if (M.length() == 1) {
			return 0;
		}

		for (int i = 1; i < N.length(); i++) {

			String temp = N.substring(N.length() - (i), N.length());
			temp += N.substring(0, N.length() - (i));


			if (temp.equals(M)) {
				return 1;
			}
		}
		return 0;
	}

}
