/*
 * 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.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;

public class Recycled {
	public static void main(String[] args) throws Exception {
		FileInputStream fstream = new FileInputStream("text.in");
		// Get the object of DataInputStream
		DataInputStream in = new DataInputStream(fstream);
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		String strLine;
		int count = 0;
		int totalLines;
		// ArrayList<List> numbers = new ArrayList<List>();
		while ((strLine = br.readLine()) != null) {
			if (count == 0) {
				totalLines = Integer.parseInt(strLine);
			} else {
				int recycled = 0;
				String[] nums = strLine.split(" ");
				int startNum = Integer.parseInt(nums[0]);
				int endNum = Integer.parseInt(nums[1]);
				for (int i = startNum; i <= endNum; i++) {
					recycled += testInteger(i, endNum);
					
				}
				System.out.println("Case #" + count + ": " + recycled);
			}
			count++;
		}
		in.close();
	}

	private static int testInteger(int i, int endNum) {
		String numStr = String.valueOf(i);
		int currentCount = 0;
		Set<String> matches = new HashSet<String>();
		for (int j = 1; j < numStr.length(); j++) {
			String newNumStr = swapNumber(numStr);
			if ((Integer.parseInt(newNumStr) > i) && ((Integer.parseInt(newNumStr) <= endNum))) {
//				System.out.println(i+" "+newNumStr);
				currentCount++;
				matches.add(newNumStr);
		//	} else {
		//		return 0;
			}
			numStr = newNumStr;
		}
		return matches.size();
	}

	private static String swapNumber(String numStr) {
		String lastDigit = numStr.substring(numStr.length()-1);
		String firstDigits = numStr.substring(0, numStr.length()-1);
		return lastDigit.concat(firstDigits);
	}
	
	
}
