import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.Scanner;

public class ProblemC {
	public static void main(String[] args) throws FileNotFoundException {
		PrintStream out = new PrintStream(new FileOutputStream(new File(
				"c-large.out")));
		Scanner in = new Scanner(new File("C-large.in"));

		int T = in.nextInt();

		for (int i = 1; i <= T; i++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int count = 0;

			// boolean[] visited = new boolean[B - A + 1];
			for (int n = A; n <= B; n++) {
				// if (!visited[n]) {
				String origstr = Integer.valueOf(n).toString();
				String str = shift(origstr);
				while (!str.equals(origstr)) {
					int shifted = Integer.parseInt(str);

					// System.out.printf("n: %d, shift: %s, shifted: %d, valid: %b\n",
					// n, str, shifted, shifted > n);

					if (shifted > n && shifted <= B)
						count++;

					str = shift(str);
				}
				// }
			}

			out.printf("Case #%d: %d\n", i, count);
		}

		in.close();
		out.close();
	}

	public static String shift(String num) {
		return num.charAt(num.length() - 1)
				+ num.substring(0, num.length() - 1);
	}
}
