/*
 * 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.HashSet;

public class ProblemC
{
	public static void main(String[] args) throws Exception
	{
		String base = "C-small-attempt0";
		BufferedReader reader = new BufferedReader(new FileReader(base+".in"));
		BufferedWriter writer = new BufferedWriter(new FileWriter(base+".out"));
		int place = 0;
		reader.readLine();
		while (reader.ready())
		{
			String line = reader.readLine();
			String[] strs = line.split(" ");
			int a = Integer.parseInt(strs[0]);
			int b = Integer.parseInt(strs[1]);
			int num = solve(a,b);
			writer.write("Case #" + (++place) + ": " + num+'\n');
		}
		reader.close();
		writer.close();
	}

	public static int solve(int a, int b)
	{
		int number = 0;
		for (int i=a;i<=b;i++)
		{
			HashSet<Integer> set = new HashSet<Integer>();
			String str = i+"";
			for (int p=str.length()-1;p>=1;p--)
			{
				String test = str.substring(p) + str.substring(0,p);
				int j = Integer.parseInt(test);
				String test2 = j+"";
				if (i < j && j <= b && str.length()==test2.length() && !set.contains(j))
				{
					set.add(j);
					number++;
				}
			}
		}
		return number;
	}
}
