/*
 * 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 RecycledNumbers {

	public static void main(String[] args) throws FileNotFoundException {
		Scanner sc = new Scanner(new File("input"));
		int n=sc.nextInt();
		for (int i = 1; i <= n; i++) {
			int N=sc.nextInt();
			int M=sc.nextInt();			
			Set<String> set=new HashSet<String>();
			for(int j=N;j<=M;j++) {
				String currentNumber=String.valueOf(j);
				if(currentNumber.length()==1) {
					continue;
				}				
				for(int k=1;k<currentNumber.length();k++){					
					StringBuilder newNumber=new StringBuilder();
					newNumber.append(currentNumber.substring(k)).append(currentNumber.substring(0, k));
					int num1=Integer.parseInt(newNumber.toString());
					if(currentNumber.length()!=String.valueOf(num1).length()){
						continue;
					}					
					if(j!=num1 && num1>=N && num1<=M) {
						set.add(Math.min(j,num1)+":"+Math.max(j,num1));
					}
				}
			}
			System.out.println("Case #" + i + ": "+set.size());
		}
		

	}

}
