/*
 * 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 C
{
	public static void main(String[] args) throws Exception
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int numCases = Integer.parseInt(br.readLine());
		
		for(int i = 0; i < numCases; i++) {
			solveCase(i+1, br.readLine());
		}
	}
	
	private static void solveCase(int caseNum, String line) {
		String[] parts = line.split(" ");
	
		int start = Integer.parseInt(parts[0]);
		int end = Integer.parseInt(parts[1]);
		
		System.out.println("Case #"+caseNum+": "+solve(start, end));
	}
	
	private static int solve(int start, int end) {
		
		int res = 0;
		for(int i = start; i <= end; i++) {
			HashSet<Integer> encountered = new HashSet<Integer>();
			
			String asString = ""+i;
			for(int index = 1; index < asString.length(); index++) {
				char letter = asString.charAt(index);
				if(letter == '0') {
					//System.out.println(i+": skip index "+index);
					continue; // cant have leading 0
				}
				int switched = Integer.parseInt(asString.substring(index)+asString.substring(0, index));
				if(switched > i && switched >= start && switched <= end) {
					//encountered.add(i);
					
					if(encountered.contains(switched)){
						//System.out.println("already had "+switched);
						continue;
					}
					encountered.add(switched);
					res++;
					//System.out.println(i+": "+switched);
				} else {
					//System.out.println(i+": "+switched+" doesnt work");
				}
			}
		}
		return res;
	}
}