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


public class RecycledNumbers {
	public static void main(String args[]) throws IOException{
		String inputFile = args[0];
		String outputFile = args[1];
		BufferedReader input = new BufferedReader(new FileReader(inputFile));
		PrintWriter   output = new PrintWriter(outputFile);
		
		int testcases = Integer.valueOf(input.readLine());
		int testcase  = 0;
		while (testcase++ < testcases) {
			int result = 0;
			String newline = input.readLine();
			String tokens[] = newline.split(" ");
			long A = Long.valueOf(tokens[0]);
			long B = Long.valueOf(tokens[1]);
			
			int digit = 1;
			long baseAndMask = 10;
			long dummyA = A;
			while ((dummyA = dummyA / 10) > 0) {
				digit++;
				baseAndMask *= 10;
			}
			
			long i;
			for (i = A; i < B; i++) {
				int k = digit;
				long recycled = i * baseAndMask + i;
				while (k-- > 0) {
					long j = recycled % baseAndMask;
					if (j <= B && j > i) {
						result++;
					}
					recycled = recycled / 10;
				}
			}
			
			output.printf("Case #%d: %d\n", testcase, result);
		}
		
		output.close();
	}
}
