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.io.FileNotFoundException;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;

public class ProblemCC {

	/**
	 * @param args
	 * @throws FileNotFoundException
	 */
	public static boolean check(String s) {
		for (int i = 0; i < s.length() - 1; i++) {
			if (s.charAt(i) != s.charAt(i + 1))
				return true;
		}
		return false;
	}

	public static void main(String[] args) throws FileNotFoundException {
		Scanner in = new Scanner(new FileReader("C.in"));
		PrintWriter out = new PrintWriter("Clarge.out");
		int num = in.nextInt();
		for (int CASE = 1; CASE <= num; CASE++) {
			int a = in.nextInt();
			int b = in.nextInt();
			HashSet<String> hs = new HashSet<String>();
			for (int i = a; i <= b; i++) {
				String s = i + "";
				if (check(s) && s.length() > 1) {
					for (int k = s.length() - 2, j = 0; k >= 0 && j < s.length() - 1; j++, k--) {
						String newS = s.substring(k + 1) + s.substring(0, k + 1);
						int newInt = Integer.parseInt(newS);
						if (newInt <= b && i < newInt && s.length() == (newInt + "").length() && !newS.equals(s)) {
							if (i < Integer.parseInt(newS))
								hs.add(i + " " + newS);
							else
								hs.add(newS + " " + i);
						}
					}
				}
			}
			out.println("Case #" + CASE + ": " + hs.size());
		}
		out.close();
	}
}
