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.Scanner;

public class Test {
	public static void main(String[] args) {
		Scanner sin = new Scanner(System.in);
		int cases, a, b;
		int[] ans;

		cases = sin.nextInt();
		ans = new int[cases];
		for (int i = 0; i < cases; i++) {
			int count = 0;

			a = sin.nextInt();
			b = sin.nextInt();

			for (int j = a; j <= b; j++) {
				String ori = String.valueOf(j);
				int[] temp = new int[ori.length() - 1];
				int tempIndex = 0;

				for (int k = 1; k < ori.length(); k++) {
					String newStr = ori.substring(k, ori.length())
							+ ori.substring(0, k);
					int newInt;
					boolean skip = false;

					if (newStr.charAt(0) == '0')
						continue;

					newInt = Integer.parseInt(newStr);

					for (int m = 0; m < tempIndex; m++)
						if (temp[m] == newInt) {
							skip = true;
							break;
						}

					if (skip == false)
						temp[tempIndex++] = newInt;
					else
						continue;

					if (j < newInt && newInt >= a && newInt <= b)
						count++;
				}
			}
			ans[i] = count;
		}

		for (int i = 0; i < cases; i++)
			System.out.println("Case #" + (i + 1) + ": " + ans[i]);
	}
}