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.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class C {
    static String shift(String s) {
        return s.charAt(s.length() - 1) + s.substring(0, s.length() - 1);
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        for (int t = 1; t <= T; ++t) {
            int A = sc.nextInt(), B = sc.nextInt(), count = 0;
            for (int n = A; n <= B; ++n) {
                String s0 = Integer.toString(n);
                Set<Integer> matches = new HashSet<Integer>();
                for (String s = shift(s0); !s.equals(s0); s = shift(s)) {
                    if (!s.startsWith("0")) {
                        int m = Integer.parseInt(s);
                        if (m >= A && m <= B)
                            matches.add(m);
                    }
                }
                count += matches.size();
            }
            System.out.printf("Case #%d: %d\n", t, count/2);
        }
    }
}
