package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

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

public class C {

	private static Scanner in = new Scanner(System.in);

	private static void solve(int no) {
		int A = in.nextInt();
		int B = in.nextInt();
		int keta = String.valueOf(A).length();
		int ans = 0;
		Set<Integer> set = new HashSet<>();
		for (int n = A; n < B; n++) {
			set.clear();
			String nstr = String.valueOf(n);
			for (int i = 1; i < keta; i++) {
				String rot = nstr.substring(i) + nstr.substring(0, i);
				int m = Integer.parseInt(rot);
				if (n < m && m <= B && set.add(m)) {
					// System.out.printf("%d %d%n", n, m);
					ans++;
				}
			}
		}
		System.out.printf("Case #%d: %d%n", no, ans);
	}

	public static void main(String[] args) {
		int T = in.nextInt();
		for (int i = 0; i < T; i++) {
			solve(i + 1);
		}
	}

}
