package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * @author OleGG
 */
public class QualTaskC {
    public static void main(String[] args) throws Throwable {
        Scanner sc = new Scanner(new FileReader("C-small-attempt0.in.txt"));
        PrintWriter pw = new PrintWriter(new FileWriter("C-small-attempt0.out.txt"));
        int t = sc.nextInt();

        for (int test = 1; test <= t; ++test) {
            int a = sc.nextInt();
            int b = sc.nextInt();

            int mul = 1;
            while (mul <= a) {
                mul *= 10;
            }
            mul /= 10;

            int res = 0;
            for (int i = a; i < b; ++i) {
                int curr = i;
                do {
                    int temp = curr % 10;
                    curr /= 10;
                    curr += temp * mul;
                    if (curr > i && curr <= b) {
                        ++res;
                    }
                } while (curr != i);
            }

            pw.printf("Case #%d: %d\n", test, res);
        }
        pw.close();
    }
}
