/*
 * 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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Pairs {

	/**
	 * @param args
	 */
	
	public static int counter=0;
	
	public static void checkhelper(String a,String b)
	{
		if(a.length()!=b.length())
			return;
		if(a.concat(a).contains(b))
			counter++;	
	}
	
	
	public static void check(int a,int b)
	{
		for(int i=a;i<=b;i++)
		{
			for(int j=i+1;j<=b;j++)
			checkhelper(""+i, ""+j);
			
		}
		
		
	}
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub

		
		BufferedWriter bw=new BufferedWriter(new FileWriter("out2.out"));
		BufferedReader bf=new BufferedReader(new FileReader("input.txt"));
		int count=Integer.parseInt(bf.readLine());
		for(int i=0;i<count-1;i++)
		{
			
			String line=bf.readLine();
		String []a=line.split(" ");
		
		check(Integer.parseInt(a[0]),Integer.parseInt(a[1]));
	
	bw.write("Case #"+(i+1)+": "+counter);
	bw.newLine();
	counter=0;
	}
		
		String line=bf.readLine();
		String []a=line.split(" ");
		
		check(Integer.parseInt(a[0]),Integer.parseInt(a[1]));
	
	
	bw.write("Case #"+(count)+": "+counter);
	bw.close();
	}

}
