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

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.StringTokenizer;

public class recycled {
	static String next() {
		if (st == null || !st.hasMoreTokens())
			nextLine();
		return st.nextToken();
	}

	static int nextInt() {
		return Integer.parseInt(next());
	}

	static void nextLine() {
		try {
			st = new StringTokenizer(f.readLine());
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	static StringTokenizer st;
	static PrintWriter out;
	static BufferedReader f;

	public static void main(String[] args) throws IOException {
		String progName = (recycled.class.getCanonicalName()) + ".out";
		f = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		out = new PrintWriter(new BufferedWriter(new FileWriter(progName)));
		int T = nextInt();
		for (int t = 1; t <= T; t++) {
			int count = 0;
			int A = nextInt(), B = nextInt();
			for (int x = A; x <= B; x++) {
				HashSet<Integer> hs = new HashSet<Integer>();
				String s = "" + x;
				for (int i = 1; i < s.length(); i++) {
					String ss = s.substring(i) + s.substring(0, i);
					if (ss.charAt(0) == '0')
						continue;
					int xx = Integer.parseInt(ss);
					if (xx >= A && xx <= B&&x<xx) {
						if (hs.contains(xx))
							continue;
						else
							hs.add(xx);
						count++;
					}
				}
			}
			out.printf("Case #%d: %d\n", t, count);
		}

		out.close();
		// System.exit(0);
	}

}