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

public class JuanjeProblemaC 
{
	public static void main(String[] args){
		Scanner entrada = new Scanner(System.in);
		int tam = entrada.nextInt();
		for(int problema = 1; problema <= tam;problema++)
		{
			int A = entrada.nextInt();
			int B = entrada.nextInt();
			int resultado = 0;
			for(int indice=A;indice<=B;indice++) 
			{
			
				ArrayList<Integer> pares = new ArrayList<Integer>();
				String ns = indice+"";
				for (int j=ns.length()-1;j>0;j--) {
					String k = ns.substring(j);
					String nuevoVal = k + ns.substring(0,j);
					int m = Integer.parseInt(nuevoVal);
					if (m>indice && A<m && B>=m) 
					{ 
						if (pares.indexOf(m)==-1)
							pares.add(m);
					}
				}
				int tamPares = pares.size();
				resultado += tamPares;
			}
			
			System.out.format("Case #%d: %d\n", problema, resultado);
		}
	}
	
}