import java.io.*;
import java.math.BigInteger;
import java.util.*;

import org.jfree.data.function.PowerFunction2D;

public class r2a
{

	Map numMap = new HashMap();
    int output = 0;

    /**
     * @param args
     */
    public static void main(String[] args)
    {
        r2a mk = new r2a();
        try {
            FileInputStream fstream = new FileInputStream("d:/cjinput.txt");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            String str;
            int i = 0;
            while ((str = br.readLine()) != null) {
            	int begin=0,end = 0;
                i++;
                if (i == 1)
                    continue;
                mk.numMap = new HashMap();
                StringTokenizer strTok = new StringTokenizer(str, " ");
                while (strTok.hasMoreTokens()) {
                	begin =  Integer.parseInt(((String) strTok.nextToken()));
                    end = Integer.parseInt(((String) strTok.nextToken()));
                }

                mk.evaluate(i, begin, end);

            }
            in.close();
        }
        catch (Exception e) {
            System.err.println(e);
        }

    }

    private void evaluate(int rowNum, int begin, int end)
    {
    	output=0;
    	for (int i = begin; i<= end; i++) {
    		if(numMap.containsKey(Integer.valueOf(i)))
    			continue;
    		List l = getPairElems(i);
    		if (l.size() > 0) {
    			Iterator itr = l.iterator();
    			int ctr = 0;
    			ArrayList tempList = new ArrayList();
    			while (itr.hasNext()) {
    				int next = ((Integer)itr.next()).intValue();
    				if (next <= end && next > i) {
    					numMap.put(Integer.valueOf(next), i);
    					tempList.add(next);
    					ctr++;
    				}
    			}
    			ctr = getCounter(ctr+1,2);
/*    			if (tempList.size() > 0 || ctr > 0)
    				System.out.println("DD: " + i + ": " + tempList +" ; ctr = " + ctr);*/
    			output = output + ctr;
    		}
    		
    	}

        String outputStr = "Case #" + (rowNum -1) + ": " + output;
        
        System.out.println(outputStr);
    }

	private int getCounter(int n, int r) {
		int ret = 1;
		int nfactorial =1;
		for (int i = 2; i<=n; i++) {
			nfactorial = i*nfactorial;
		}
		int nrfact =1;
		for (int i = 2; i<=n-r; i++) {
			nrfact = i*nrfact;
		}
		
		return nfactorial/(2*nrfact);
	}

	private ArrayList getPairElems(int num) {
		ArrayList retList = new ArrayList();
		int temp = num;
		if (num/10 == 0)
			return retList;
		
		String str = String.valueOf(num);
		
		int arr[] = new int[str.length()];
		int x = str.length();
		while (temp/10 > 0) {
			arr[x-1] = temp%10;
			temp=temp/10;
			x--;
		}
		arr[0]=temp;
		
		int size = arr.length;
		for (int pos = size -1; pos >0; pos--) {
			if(arr[pos] == 0)
				continue;
			int pairNum = 0;
			int multiplier =1;
			for (int c=0; c < size-1; c++) {
				multiplier = multiplier*10;
			}
			pairNum = pairNum + (arr[pos]*multiplier);
			for(int ctr = pos+1, i=1; i < size; i++,ctr++) {
				if (ctr == size)
					ctr=0;
				if (multiplier!=1)
					multiplier=multiplier/10;
				pairNum = pairNum + (arr[ctr]*multiplier);
			}
			if (pairNum != num)
				retList.add(Integer.valueOf(pairNum));			
		}
		
		return retList;
	}
}

/**
 * 
 */

import hack.PolynomialFactoring;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;

/**
 * http://code.google.com/codejam/contest/dashboard?c=1460488#s=p2 a pair of
 * distinct positive integers (n, m) is recycled if you can obtain m by moving
 * some digits from the back of n to the front without changing their order.
 * 
 * @author y
 */
public class RotateNumbers {

	/**
	 * Given integers A and B with the same number of digits and no leading
	 * zeros, how many distinct recycled pairs (n, m) are there with A ¡Ü n < m ¡Ü
	 * B?
	 * 
	 * @param min
	 * @param max
	 */
	static int pairsRotated  (int min, int max){
		if(max<10 || max<=min){return 0;}
		int ret = 0;
		
		for(int j=min; j<max; j++){
			String s = String.valueOf(j);

			HashSet<Integer> set = new HashSet<Integer>();
			
			for(int k=1; k<s.length(); k++){//iterate each digit
				
				//rotate from bigger digit
				if(s.charAt(k)>=s.charAt(0)){ //=212-> 221. ignore repeat, count (12, 21) once
					
					String rotateString = s.substring(k) + s.substring(0, k);	
					
					int rotate = Integer.valueOf(rotateString);
					
					if((j<rotate) && (rotate <=max)){ //rotate>=min
						if(!set.contains(rotate)){
							set.add(rotate);
							ret ++; 
						}						
						//System.out.println(j + "-> " + rotate);
					}
				}
			}
		}
		
		return ret;
	}

	public static void main(String[] args) {
		
		createOutput();

		List<String[]> input = readLine();

		for (int j = 0; j < input.size(); j++) {

			String[] line = input.get(j);
			int n =  Integer.parseInt(line[0]);
			int k =  Integer.parseInt(line[1]);
			int ret = pairsRotated(n, k);

			String outputLine = "Case #" + (j+1) + ": " + ret;
			System.out.println(outputLine);
			writeOutput(outputLine);
		}	

	}
	

	public static List<String[]> readLine(){
		return readLine("input.txt");
	}
	
	public static List<String[]> readLine(String inputFile){
		List<String[]> list = new ArrayList<String[]>();
		//String lineSeparator= System.getProperty("line.separator");
		
		try {
			InputStream stream = PolynomialFactoring.class.getClassLoader().
					getResourceAsStream(inputFile);			
			BufferedReader input = new BufferedReader(new InputStreamReader(stream));//new FileReader(inputFile));
			String line = null; 

			if ((line = input.readLine()) != null) {
			}
			
			try {
				while ((line = input.readLine()) != null) {					
					//logger.info("input: " + line );
					String[] words = line.split(" ");
					
					list.add(words);
					//parse line and run code.

				}
					
			} catch (Exception e) {
				e.printStackTrace();
			} finally {
				input.close();
			}
		} catch (IOException ex) {
			ex.printStackTrace();
		}

		return list;
	}
	

	private static final String OUTPUT_TXT = "./output.txt";

	public static void createOutput() {

		try {
			new FileWriter(OUTPUT_TXT);
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

	public static void writeOutput(String content) {
		BufferedWriter output;
		try {
			output = new BufferedWriter(new FileWriter(OUTPUT_TXT, true));

			try {
				output.write(content + "\r\n");
			} catch (Exception e) {
				e.printStackTrace();
			} finally {
				output.close();
			}
		} catch (IOException e1) {
			e1.printStackTrace();
		}

	}

}
