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 RecycledNumbers {
	
	static int recycle(int n, int B) {
		String nString = String.valueOf(n);
		
		int out = 0;

		for (int i = 0; i < nString.length(); i++) {
			int cut = nString.length() - (i + 1);
			String temp = nString.substring(cut) + nString.substring(0, cut);
			
			int pair = Integer.parseInt(temp);
				
			if (n < pair && pair <= B) {
				//System.out.println(n + " " + pair);
				out++;
			}
		}
		
		return out;
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int cases = sc.nextInt();
		
		StringBuilder out = new StringBuilder();
		for (int i = 1; i <= cases; i++) {
			int A = sc.nextInt();
			int B = sc.nextInt();

			int pairs = 0;
			
			for (int j = A; j < B; j++) {
				pairs += recycle(j, B);
			}
			
			out.append("Case #" + i + ": " + pairs + "\n");
		}
		
		System.out.print(out);
	}
}
