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.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;
    }
}
