import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

import java.util.Set;
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.io.FileInputStream;
import java.util.HashSet;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream;
		try {
			inputStream = new FileInputStream("Main/input.txt");
		} catch (IOException e) {
			throw new RuntimeException(e);
		}
		OutputStream outputStream;
		try {
			outputStream = new FileOutputStream("Main/output.txt");
		} catch (IOException e) {
			throw new RuntimeException(e);
		}
		Scanner in = new Scanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		C solver = new C();
		int testCount = Integer.parseInt(in.next());
		for (int i = 1; i <= testCount; i++)
			solver.solve(i, in, out);
		out.close();
	}
}

class C {
    public void solve(int testNumber, Scanner in, PrintWriter out) {
        int A = in.nextInt(), B = in.nextInt();
        int digit, a = A, ten = 1;
        digit = countDigit(a);
        for (int i = 0; i < digit - 1; ++i) ten *= 10;
        Set<Integer> set = new HashSet<Integer>();
        long ans = 0;
        for (int num = A; num <= B; ++num)
            if (!set.contains(num)) {
                Set<Integer> curSet = new HashSet<Integer>();
                int cur = num;
                curSet.add(cur);
                for (int i = 0; i < digit; ++i) {
                    cur = cur % 10 * ten + cur / 10;
                    if (A <= cur && cur <= B && countDigit(cur) == digit)
                        curSet.add(cur);
                }
                int cnt = curSet.size();
                ans += (cnt * (cnt - 1)) / 2;
                for (int i : curSet) set.add(i);
            }
        out.print(String.format("Case #%d: %d\n", testNumber, ans));
    }

    private int countDigit(int n) {
        int digit = 0;
        while (n > 0) {
            digit++;
            n /= 10;
        }
        return digit;
    }
}

