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.util.HashSet;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

/**
 * Created by IntelliJ IDEA.
 * User: elbek
 * Date: 4/13/12
 * Time: 7:31 PM
 * To change this template use File | Settings | File Templates.
 */
public class Test {

    public static void main(String[] args) {
        int count = 0;
        Set<String> found = new TreeSet<String>();
        int t = 50;

        Scanner scanner = new Scanner(System.in);


        for (int q = 0; q <= t; q++) {
            count = 0;
            String str = scanner.nextLine();

            String []arg = str.split(" ");
            Integer a = Integer.parseInt(arg[0]);
            Integer b = Integer.parseInt(arg[1]);
            for (int i = a; i <= b; i++) {
                String input = String.valueOf(i);

                String changed;
                int len = input.length();

                for (int j = 1; j < len; j++) {

                    changed = input.substring(j, len) + input.substring(0, j);
                    if (Integer.valueOf(changed) <= Integer.valueOf(input)) continue;

                    if (Integer.valueOf(changed) <= b && Integer.valueOf(changed) >= a) {
                        found.add(input + " - " + changed);
//                    found.add(changed);
                        count++;
                    }
                }
            }
            System.out.println("Case #"+(q+1)+": "+count);
        }
    }
}
