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

public class C {
	public static void main(String[] args) throws IOException {
		String filename = "C-small-attempt0";
		String inname = filename + ".in";
		String outname = filename + ".out";
		Scanner sc = new Scanner(new File(inname));
		//Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(new FileWriter(outname));

		int N = sc.nextInt();
		for (int t = 1; t <= N; t++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			int l = Integer.toString(a).length();
			int ans = 0;
			for(int n = a; n <= b; n++) {
				for(int i = 1; i < l; i++) {
					int front = n/((int)Math.pow(10, i));
					int back = n%((int)Math.pow(10, i));
					int m = back * (int) Math.pow(10,l-i) + front;
					//System.out.println(m + " " + n);
					if(m != n && m/(int)Math.pow(10,l-1) != 0 && n < m && m <= b) ans++;
				}
				
			}
			out.println("Case #" + t + ": " + ans);
			System.out.println("Case #" + t + ": " + ans);
		}
		out.close();
	}
}
