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.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * @author OleGG
 */
public class QualTaskC {
    public static void main(String[] args) throws Throwable {
        Scanner sc = new Scanner(new FileReader("C-small-attempt0.in.txt"));
        PrintWriter pw = new PrintWriter(new FileWriter("C-small-attempt0.out.txt"));
        int t = sc.nextInt();

        for (int test = 1; test <= t; ++test) {
            int a = sc.nextInt();
            int b = sc.nextInt();

            int mul = 1;
            while (mul <= a) {
                mul *= 10;
            }
            mul /= 10;

            int res = 0;
            for (int i = a; i < b; ++i) {
                int curr = i;
                do {
                    int temp = curr % 10;
                    curr /= 10;
                    curr += temp * mul;
                    if (curr > i && curr <= b) {
                        ++res;
                    }
                } while (curr != i);
            }

            pw.printf("Case #%d: %d\n", test, res);
        }
        pw.close();
    }
}
