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

// usage: java c infile > outfile
import java.io.BufferedReader;
import java.io.FileReader;
import java.util.Set;
import java.util.HashSet;

public class c
{
	public static void main(String[] args) throws Exception
	{
		String infile = args[0];
		
		BufferedReader reader = new BufferedReader(new FileReader(infile));
		int T = Integer.parseInt(reader.readLine());
		for (int t = 1; t <= T; t++)
		{
			Set<String> pairs = new HashSet<String>();
			String[] inputs = reader.readLine().split(" ");
			int A = Integer.parseInt(inputs[0]);
			int B = Integer.parseInt(inputs[1]);
			int length = inputs[0].length();
			//System.out.println("test = " + A + ", " + B + ", " + length);
			
			int total = 0;
			for (int i = A; i <= B; i++)
			{
				String trial = "" + i;
				//System.out.println("i = " + i);
				for (int n = 1; n < length; n++)
				{
					int j = Integer.parseInt(trial.substring(n) + trial.substring(0, n));
					//System.out.println(trial.substring(n) + ":" + trial.substring(0, n));
					if (trial.charAt(n) == '0')
					{
						continue;
					}
					
					String pair = i + " " + j;
					if (i < j && j <= B && !pairs.contains(pair))
					{
						total++;
						pairs.add(pair);
					}
				}
			}
			
			System.out.println("Case #" + t + ": " + total);
		}
		reader.close();
	}
}
