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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author viswas
 */
public class Recycled {


    public static void main(String [] args)throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int t = 1;

        int T = Integer.parseInt(br.readLine());
        while(T-- > 0){

            long count = 0;
            StringTokenizer str = new StringTokenizer(br.readLine(), " ");
            int A = Integer.parseInt(str.nextToken());
            int B = Integer.parseInt(str.nextToken());

            ArrayList <Integer> Alist = new ArrayList<Integer>();

            for(int i = A; i <= B; i++){
                String s = i + "";
                String aa = s;
                int len = s.length();
                s += s;
                Alist.clear();
                for(int j = 0; j < len; j++){
                    String s1 = s.substring(j, j + len);
                    int s2 = Integer.parseInt(s1);
                    if(!Alist.contains(s2)){
                        s1 = s2 + "";
                        if(i < s2 && aa.length() == s1.length() && B >= s2){
                            count++;
                            //System.out.println(n.substring(0, len) + " " + m);
                        }
                        Alist.add(s2);
                    }
                }
            }
            System.out.printf("Case #%d: %d", t, count);
            System.out.println();
            t++;
        }
    }

}

