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

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

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

public class Main {
	public static void main (String[] args) {
		int i = 1;
		try{
			BufferedReader in = new BufferedReader(new FileReader("input.txt"));
			String ligne;
			ligne = in.readLine();
			ligne = in.readLine();
			while (ligne != null) {
				int res = 0;
				System.out.print("Case #" + i + ": ");
				Scanner sc = new Scanner(ligne);
				int A = sc.nextInt();
				int B = sc.nextInt();
				for (int m=A;m<B;m++){
					for (int n=m+1;n<=B;n++){
						if(recycle(n, m)){
							res++;
						}
					}
				}
				i++;
				System.out.println(res);
				ligne = in.readLine();
			}
			in.close();
		} catch (Exception e){
			System.err.println("Erreur !");
		}
	}

	//prÃ©conditions : a != b a>0 b>0
	public static boolean recycle (int a, int b) {
		long nbDigitsA = Math.round(Math.ceil(Math.log10(a)));
		long nbDigitsB = Math.round(Math.ceil(Math.log10(b)));
		if (nbDigitsA != nbDigitsB || nbDigitsA == 1) {
			return false;
		}
		for (int i=1;i<nbDigitsA;i++){
			String ch_b = "" + b;
			String ch_bTrans = ch_b.substring(i) + ch_b.substring(0, i);
			if (a == Integer.parseInt(ch_bTrans)) {
				return true;
			}
		}
		return false;
	}
}
