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 QC {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int[][] ROT = new int[2000001][7];
		for(int i=1; i<=2000000; i++) {
			int A = i;
			int pow10 = 1;
			while(A > 0) { pow10*=10; A/=10; }
			pow10 /= 10;
			A = i;
			int ix = 0;
			do {
				if(A < i)
					ROT[i][ix++] = A;
				A = pow10*(A%10)+A/10;
			} while(A != i);
		}
		
		int T = in.nextInt();
		for(int cas=0; cas<T; cas++) {
			int A = in.nextInt();
			int B = in.nextInt();
			long ans = 0;
			Set<Integer> U = new HashSet<Integer>();
			for(int i=A; i<=B; i++) {
				long cnt = 0;
				for(int j=0; j<7; j++) {
					if(ROT[i][j]<i && ROT[i][j]>=A && ROT[i][j]<=B)
						cnt++;
				}
				ans += cnt;
			}
			System.out.println("Case #"+(cas+1)+": "+ans);
		}
	}
}