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.net.*;
import java.io.*;
import java.lang.*;

public class RecycledNumbers {
    public static void clear(int[] arr){
    	for(int i=0; i<30; i++)
    		arr[i] = -1;		
    }
    public static boolean checkEntry(int x, int[] arr){
    	for(int i=0; i<30; i++) {
    		if(x == arr[i])
    			return true;
    	}
    	return false;	
    }
    
    
    public static void main(String[] args) throws IOException {
    
    String[] spl;
    int counter = 1;
    int count = 0;
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		String input;
		int a,b,e = 0;
		String xform;
		int[] arr = new int[30]; int arrCounter = 0;
		clear(arr); 
		
		while((input = in.readLine()) != null){
			spl = input.split(" ");
			a = Integer.parseInt(spl[0]);
			b = Integer.parseInt(spl[1]);
			int bLength = (Integer.toString(b)).length();
			for(int i=a; i<b; i++) {
				clear(arr); arrCounter = 0;
				xform = Integer.toString(i);
				int l = xform.length();
				//System.out.println("number:" + xform + '\t' + "length:" + l);
				for(int j=1; j<l; j++) {	
					for(int k=0; k<l; k++){
						int index = (k + j) % l;
						if(xform.charAt(index) < xform.charAt(k))
							break;
						else if(xform.charAt(index) > xform.charAt(k)) {
							if( (bLength > l) || (b >= (e = Integer.parseInt(xform.substring(j) + xform.substring(0 , j)))) ) {    
								//System.out.println("number:" + xform + '\t' + Integer.parseInt(xform.substring(j) + xform.substring(0 , j)));
								if(!checkEntry(e , arr)){
									count++;
									arr[arrCounter] = e;
									arrCounter++;
								}
								break;
							}
							else
								break;
						}
						else
							continue;
					}
				}
			}
			
			System.out.println("Case #" + counter + ": " + count );
			counter++; count = 0;
		}
		
		    

}}
