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

public class C {
	static int solve(int a, int b) {
		int result = 0;
		for(int i = a; i <= b; ++i) {
			result += suffle(a, b, i);
		}
		
		return result/2;
	}
	
	static int suffle(int a, int b, int c) {
		int base = 1;
		int clen = (c+"").length();
		Set<Integer> r = new HashSet<Integer>();
		while(base < b) {
			base *= 10;
			int d = c/base;
			int e = c%base;
			int f = Integer.valueOf(e+""+d);
			int flen = (f+"").length();
			if(f != c && f >= a && f <= b && clen == flen) {
				r.add(f);
			}
		}
		
		return r.size();
	}
	
	public static void main(String args[]) {
		Scanner input = new Scanner(System.in);
		int test = input.nextInt();
		
		for(int i = 1; i <= test; ++i) {
			int a = input.nextInt(), b = input.nextInt();
			System.out.println("Case #" + i + ": " + solve(a, b));
		}
	}
}
