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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;


public class Main {
	
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(new FileReader("input.txt"));
		PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));
		int tn = sc.nextInt();
		sc.nextLine();
		for(int i = 0; i < tn; i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			int res = 0;
			for(int t = a; t <= b; t++) {
				String oppa = t + "";
				int len = (t + "").length();
				for (int u = 0; u + 1 < len; u++) {
					if(oppa.charAt(u + 1) != '0') {
						int v = Integer.parseInt(oppa.substring(u + 1, len) + oppa.substring(0, u + 1));
						if (t == v)
							break;
						if (a <= v && v <= b) {
							res++;
						}
					}
				}
			}
			pw.print("Case #" + (i + 1) + ": " + (res / 2));
			pw.println();
		}
		pw.close();
	}
}
