package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.util.Arrays;
import java.util.Scanner;

/**
 * @author Dmitry Levshunov (levshunov.d@gmail.com)
 */
public class TaskC {
    private static boolean[] used = new boolean[2000001];
    private static int length;
    private static int pow;

    public static void main(String[] args) throws Exception {
        Scanner scanner = new Scanner(System.in);

        int tests = Integer.parseInt(scanner.nextLine().trim());

        for (int test = 1; test <= tests; test++) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();

            System.out.printf("Case #%d: %s", test, solve(a, b));
            System.out.println();
        }

        scanner.close();
    }

    private static long solve(int a, int b) {
        Arrays.fill(used, false);

        length = Integer.toString(a).length();
        pow = 1;
        for (int i = 0; i < length - 1; i++) {
            pow *= 10;
        }

        long result = 0;

        for (int x = a; x <= b; x++) {
            long shiftCount = processShifts(x, a, b);
            result += shiftCount * (shiftCount - 1) / 2;
        }

        return result;
    }

    private static int processShifts(int x, int a, int b) {
        if (used[x]) {
            return 0;
        }

        int result = 0;

        for (int i = 0; i < length; i++) {
            x = (x % 10) * pow + x / 10;
            if (a <= x && x <= b && !used[x]) {
                used[x] = true;
                result++;
            }
        }

        return result;
    }
}
