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


public class RecycledNumbers {
	
	static LinkedList<String> seen = new LinkedList<String>();
	static int min, max;
	static int count;
	
	public static void main (String[] args) throws IOException {
		Scanner in = new Scanner(new File("C-small.txt"));
		
		int cases;
		cases = in.nextInt();
		
		
		for (int n = 0; n < cases; n++) {
			seen = new LinkedList<String>();
			min = in.nextInt();
			max = in.nextInt();
			
			count = 0;
			
			for (int i = min; i < max; i++) {
				findPairs(i);
			}
			
			System.out.println("Case #" + (n+1) + ": " + count);
		}

	}
	
	public static void findPairs(int num) {
		String n = "" + num;
		int result;
		
		for (int i = 1; i < n.length(); i++) {
			result = Integer.parseInt(n.substring(i) + n.substring(0, i));
			
			if (result > num && result <= max && !(seen.contains(n + " " + result))) {
				count ++;
				seen.add(n + " " + result);
			}
		}
	}
}