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.IOException;
import java.io.InputStreamReader;

public class Main {
	
	public static void main(String[] args) {
		BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
		int count = 0;
		try {
			count = Integer.parseInt(input.readLine());
		} catch (Exception e) {
			System.out.println(e.toString());
			System.exit(1);
		}
		DataModel[] dm = new DataModel[count];
		for(int i = 1; i<=count; i++) {
			try {
				dm[i-1] = new DataModel(input.readLine(),i);
				dm[i-1].run();
			} catch (IOException e) {
				System.out.println(e.toString());
				System.exit(1);
			}
		}
		for(int i = 1; i<=count;i++) {
			while(!dm[i-1].isDone()) {}
			dm[i-1].getOutput();
		}
	}
}
