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 Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T=in.nextInt();
		for(int t=1; t<=T; t++) {
			int N=0;
			
			int A=in.nextInt(), B=in.nextInt();
			int num = (int) Math.log10(B);			
			for(int n=A; n<B; n++) {
				int p=10;
				int q=(int) Math.pow(10, num);
				for(int j=0; j<num; j++) {
					int m = (n/p) + (n%p)*q;
					p*=10;
					q/=10;
					if(m > n && m <= B)
						N++;
				}
			}
			
			System.out.println("Case #"+t+": "+N);
		}
	}

}
