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


public class RecycledNumbers {

	public static void main(String[] args) throws IOException {

		Scanner sc = new Scanner(new FileReader("C-large.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("outputC2.txt"));

		int caseCount = sc.nextInt();
		sc.nextLine();

		int a, b, count, c, k, l;
		for (int caseNum = 0; caseNum < caseCount; caseNum++) {

			a = sc.nextInt();
			b = sc.nextInt();

			count = 0;
			for (int i = a; i <= b; i++) {

				k = 10;
				l = (int) Math.pow(10, (int) Math.log10(i));
				HashSet<Integer> pairs = new HashSet<Integer>();
				while (k < i) {
					c = (i % k)*l + i/k;

					if (i < c && c <= b) {
						pairs.add(c);
					}

					k *= 10;
					l /= 10;
				}
				count += pairs.size();
			}

			pw.write("Case #" + (caseNum + 1) + ": ");
			pw.write(count + "\n");
		}

		pw.flush();
		pw.close();
		sc.close();
	}
}
