/*
 * 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.Scanner;
import java.io.BufferedInputStream;
import java.util.HashSet;
public class C
{
	public static void main(String[] args)
	{
		Scanner scanner = new Scanner(new BufferedInputStream(System.in));
		
		int n = scanner.nextInt();
		for (int i = 0; i < n; i++)
		{
			int count = 0;
			int low = scanner.nextInt();
			int high = scanner.nextInt();
			for (int j = low; j < high; j++)
			{
				String s = Integer.toString(j);
				String s2;
				int len = s.length();
				HashSet<Integer> set = new HashSet<Integer>();
				
				for (int k = 0; k < len-1; k++)
				{
					s2 = s.substring(len-k-1, len) + s.substring(0, len-k-1);
					int num = Integer.parseInt(s2);
					//System.out.println(num);
					if (num >= low && num <= high && num > j && !set.contains(num))
					{
						count++;
						set.add(num);
					}
				}
			}
			System.out.println("Case #" + (i+1) + ": " + count);
		}
	}
}
