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.ArrayList;
import java.util.List;

public class JamUtil {
    static int[] parseIntList(String str, int count) {
        int[] res = new int[count];
        String[] parts = str.split(" ");
        for (int i = 0; i < parts.length; i++) {
            String part = parts[i];
            res[i] = Integer.parseInt(part);
        }
        return res;
    }

    static List<Integer> parseIntList(String str) {
        ArrayList<Integer> res = new ArrayList<Integer>();
        String[] parts = str.split(" ");
        for (int i = 0; i < parts.length; i++) {
            String part = parts[i];
            res.add(Integer.parseInt(part));
        }
        return res;
    }

    static<T> String printTable(T[][] t) {
        StringBuilder res = new StringBuilder();
        for (int i = 0; i < t.length; i++) {
            T[] ts = t[i];
            for (int j = 0; j < ts.length; j++) {
                T t1 = ts[j];
                res.append(t1+ " ");
            }
            res.append("\n");
        }
        return res.toString();
    }
}
