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

public class Mirror {
	public static void main(String[] args) throws IOException { 
		Scanner scan = new Scanner(new File("C-small-attempt0.in"));
		FileWriter fstream = new FileWriter("out.txt");
		BufferedWriter out = new BufferedWriter(fstream);
		int numCases = scan.nextInt();
		for (int z = 0; z < numCases; z++) {
			int low = scan.nextInt();
			int high = scan.nextInt();
			int count = 0;
			for (int i = low; i < high; i++) {
				String lows = "" + i;
				String[] arr = new String[lows.length() - 1];
				for (int k = 0; k < arr.length; k++) {
					lows = lows.charAt(lows.length()-1) + lows.substring(0, lows.length()-1);
					arr[k] = lows;
				}
				for ( int j = i + 1; j <= high; j++) {
					String highs = "" + j;
					for (int k = 0; k < arr.length; k++) {
						if (arr[k].equals(highs)) {
							count++;
							break;
						}
					}
				}
			}
			out.write("Case #" + (z+1) + ": " + count);
			if ( z != numCases - 1)
				out.newLine();
		}
		out.close();
	}
}