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.io.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner scanner = null;
		try {
			scanner = new Scanner(new File(args[0]));
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		int t = Integer.parseInt(scanner.nextLine());
		int count;
		int min, max;
		for (int i = 1; i <= t; i++) {
			count = 0;
			min = scanner.nextInt();
			max = scanner.nextInt();
			for (int j = min; j <= max; j++) {
				for (int k = j+1; k <= max; k++) {
					if (isRecycled(j, k)) {
						count++;
					}
				}
			}
			System.out.println("Case #"+i+": " + count);
		}
	}
	
	private static boolean isRecycled(int n, int m) {
		boolean flag = false;
		char[] na = String.valueOf(n).toCharArray();
		char[] ma = String.valueOf(m).toCharArray();
		if (na.length == ma.length && na[0] != '0' && ma[0] != '0') {
			if (sum(na) == sum(ma)) {
				char tmp;
				for (int i = 0; !flag && i < na.length; i++) {
					tmp = na[na.length-1];
					System.arraycopy(na, 0, na, 1, na.length-1);
					na [0] = tmp;
					if (Arrays.equals(na, ma)) {
						flag = true;
					}
				}
			}
		}
		return flag;
	}
	
	private static int sum(char[] arr) {
		int sum = 0;
		for (int i = 0; i < arr.length; i++) {
			sum += arr[i];
		}
		return sum;
	}

}
