/*
 * 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 {
		BufferedReader in = new BufferedReader(new FileReader("input.txt"));
		PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));		
		int CaseNumber = Integer.parseInt(in.readLine());		
		for (int cas=1; cas <= CaseNumber; cas++) {
			int nbr = 0 ;			
			String[] str = in.readLine().split(" ");
			int A = Integer.parseInt(str[0]);
			int B = Integer.parseInt(str[1]);
			if(A < 10) {
				pw.println("Case #"+cas+": "+nbr);
			}
			else if(A==B){
				pw.println("Case #"+cas+": "+nbr);
			}
			else{
				ArrayList<String> n = new ArrayList<String>();
				for(int i=A; i<=B; i++){
					String st = Integer.toString(i);
					int l = st.length();
					for(int j=l-1; j>0 ; j--){
						String s = st;
						s = s.substring(j) + s;
						s = s.substring(0,l);
						
						if(Integer.parseInt(s) >A && Integer.parseInt(s) <B && Integer.parseInt(s)!=i && !n.contains(""+i+"-"+s) && !n.contains(s+"-"+i)){
							n.add(s+"-"+i);
							n.add(""+i+"-"+s);
							nbr++;
						}
					}	
				}
				pw.println("Case #"+cas+": "+nbr);
			}
		}
		
		in.close();
		pw.flush();
		pw.close();
	}
	
	public static void main(String[] args) throws Exception {
		(new Solution()).doMain();
	}
}