package fixjava;

public class StringUtils {

	/** Repeat the given string the requested number of times. */
	public static String repeat(String str, int numTimes) {
		StringBuilder buf = new StringBuilder(Math.max(0, str.length() * numTimes));
		for (int i = 0; i < numTimes; i++)
			buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the left hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padLeft(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(padChar);
		for (int i = 1, mi = bufSize - str.length(); i < mi; i++)
			buf.append(padChar);
		buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the right hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padRight(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(str);
		buf.append(padChar);
		while (buf.length() < bufSize)
			buf.append(padChar);
		return buf.toString();
	}

	/** Intern all strings in an array, skipping null elements. */
	public static String[] intern(String[] arr) {
		for (int i = 0; i < arr.length; i++)
			arr[i] = arr[i].intern();
		return arr;
	}

	/** Intern a string, ignoring null */
	public static String intern(String str) {
		return str == null ? null : str.intern();
	}

}

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

public class Tres {
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new FileReader("tres.txt"));
        int T = Integer.parseInt(in.readLine());
        for(int t = 0; t < T; t++) {
            String[] temp = in.readLine().split(" ");
            int A = Integer.parseInt(temp[0]);
            int B = Integer.parseInt(temp[1]);
            HashMap<String, Integer> matches = new HashMap<String, Integer>();
            for(int i = A; i <= B; i++) {
                String s = new Integer(i).toString();
                int j;
                for(j = 0; j < s.length(); j++) {
                    String stemp = s.substring(j) + s.substring(0,j);
                    if(matches.containsKey(stemp)) {
                        matches.put(stemp, matches.get(stemp)+1);
                        //System.out.println(s + " matched with " + stemp);
                        break;
                    }
                }
                if(j == s.length()) matches.put(s, 1);
            }
            int answer = 0;
            for(String s : matches.keySet()) {
                int itemp = matches.get(s);
                answer += itemp*(itemp-1)/2;
            }
            System.out.println("Case #" + (t+1) + ": " + answer);
        }
        in.close();
    }
}