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

import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Scanner;
public class ProblemC {
	static long[] pow = new long[12];
	private static long solve(int a, int b) {
		HashMap<Integer, LinkedList<Integer>> f = new HashMap<Integer, LinkedList<Integer>>();
		long res = 0;
		for (int i = a; i <= b; i++) {
			int s = (i + "").length();
			for (int j = 1; j < s; j++) {
				int c = (int) ((i / pow[j]) + pow[s - j] * (i % pow[j]));
				if (c <= b && c >= a && c != i && (c + "").length() == s) {
					boolean k = f.containsKey(i);
					if (!k)f.put(i, new LinkedList<Integer>());
					if (f.containsKey(c))k = f.get(c).contains(i);
					if (!k) {f.get(i).add(c);res++;
					}
				}
			}
		}
		return res;
	}
	public static void main(String[] args) throws IOException {
		pow[1] = 10;
		for (int i = 2; i < 12; i++)
			pow[i] = pow[i - 1] * 10;
		Scanner input = new Scanner(new FileReader("input"));
		BufferedWriter output = new BufferedWriter(new FileWriter("output"));
		long res;
		int n = input.nextInt();
		for (int j = 1; j <= n; j++) {
			res = solve(input.nextInt(), input.nextInt());
			output.write("Case #" + j + ": " + res);
			output.newLine();
		}
		output.close();
	}
}