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

public class Main
{
    public static void main(String[] args)
            throws Exception
    {
        BufferedReader in = new BufferedReader(new FileReader(args[0]));
        FileWriter out = new FileWriter(args[1]);
        int T = Integer.parseInt(in.readLine());

        for (int t = 1; t <= T; t++)
        {
            String data[] = in.readLine().split("\\ ");
            int A = Integer.parseInt(data[0]);
            int B = Integer.parseInt(data[1]);

            Set<Integer> checked = new LinkedHashSet<Integer>();

            int recycledPairNumber = 0;

            for (int i = A; i <= B; i++)
            {
                if (checked.contains(i))
                    continue;

                String s = Integer.toString(i);
                String ss = s + s;

                Set<Integer> recycled = new LinkedHashSet<Integer>();
                recycled.add(i);
                for (int j = 0; j < s.length(); j++)
                {
                    int candidate = Integer.parseInt(ss.substring(j, j + s.length()));
                    if (candidate >= A && candidate <= B)
                        recycled.add(candidate);
                }

                if (recycled.size() == 1)
                    continue;

                checked.addAll(recycled);

                recycledPairNumber += (recycled.size() * (recycled.size() - 1)) / 2;
            }

            out.write("Case #" + t + ": " + recycledPairNumber + "\n");
        }

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