package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.File;
import java.io.FileOutputStream;
import java.io.IOException;
import java.util.Scanner;

public class Recycle {
	public static void main(String[] args) throws IOException {
		Recycle r = new Recycle();
		// System.out.println(r.isRecycled(12345, 34512));

		String fileInput = "in.txt";

		Scanner s = new Scanner(new File(fileInput));

		int T = 0;

		T = Integer.parseInt(s.nextLine());
		FileOutputStream fos = new FileOutputStream(new File("out.txt"));

		for (int i = 1; i <= T; i++) {
			// System.out.println("Case #" + i + ": "
			// + r.recycle(s.nextInt(), s.nextInt()));
			fos.write(String.format("Case #%d: %d" + (i < T ? "\n" : ""), i,
					r.recycle(s.nextInt(), s.nextInt())).getBytes());
		}

	}

	private int recycle(int a, int b) {

		int count = 0;
		for (int n = a; n < b; n++) {
			for (int m = n + 1; m <= b; m++) {
				if (isRecycled(n, m)) {
					// System.out.println("n=" + n + " m=" + m);
					count++;
				}
			}
		}
		return count;
	}

	private boolean isRecycled(int n, int m) {
		String nm = "" + n + n;
		if (!nm.contains("" + m))
			return false;
		nm = nm.replace("" + m, "");
		nm = nm.replace("" + n, "");
		return nm.isEmpty();
	}
}
