/*
 * 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.util.*;
import java.io.*;

public class Solution {
	public void doMain() throws Exception {
		Scanner sc = new Scanner(new FileReader("/home/vivek/workspace/codejam2012problem2/src/input.txt"));
		PrintWriter pw = new PrintWriter(new FileWriter("/home/vivek/workspace/codejam2012problem2/src/output.txt"));
		//Scanner sc = new Scanner(System.in);
		//PrintWriter pw = new PrintWriter(System.out);
		int T = sc.nextInt();
		//sc.nextLine();		
		for (int j = 0; j < T; j++) {
			long a = sc.nextLong();
			long b = sc.nextLong();
			int count=0;
			pw.print("Case #" + (j + 1) + ": ");			
			for(long i=a;i<=b;i++){
				String N=i+"";
				String M=i+"";int n=M.length();				
				int check=0;
				List<Long> al=new ArrayList<Long>();
				for(int k=0;k<n;k++){					
					M=M.charAt(n-1)+M;
					M=M.substring(0,n);	
					if(!al.contains(new Long(Long.parseLong(M))) &&  Long.parseLong(M)<=b && Long.parseLong(N)<Long.parseLong(M) && a<Long.parseLong(M))
						count++;
					al.add(Long.parseLong(M));
					
				}							
			}			
			pw.println(count);
		}		
		pw.flush();
		pw.close();
		sc.close();
	}
	
	public static void main(String[] args) throws Exception {
		new Solution().doMain();
	}
}