/*
 * 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 Recycled {
	public static void main(String[] args) {
		
		Scanner p = new Scanner(System.in);
		int tests = p.nextInt();
		
		for(int i = 0; i<tests; i++) {
			int count = 0;
			boolean[] used = new boolean [1001];
			Integer a = p.nextInt();
			Integer b = p.nextInt();
			if( b == 1000 ) {
				b = 999;
			}
			for( ; a<b; a++) {
				if( a < 10 ) {
					a = 10;
				}
				char[] start = ((a.toString()).toCharArray() );
				if(a <= 99) {
					char temp0 = start[0];
					char temp1 = start[1];
					
					start[1] = temp0;
					start[0] = temp1;
					int number1 = Integer.parseInt(new String(start));
					if(number1 <= b && number1 >= a && !used[number1] && number1 != a) {
						used[a] = true;
						count++;
					}
				}
								
				else if(a >= 100) {
					char temp0 = start[0];
					char temp1 = start[1];
					char temp2 = start[2];
					//one rotation
					start[2] = temp1;
					start[1] = temp0;
					start[0] = temp2;
					int number1 = Integer.parseInt(new String(start));
					if(number1 <= b && number1 >= a && !used[number1] && number1 != a) {
						used[a] = true;
						count++;
					}
				
					start[2] = temp0;
					start[1] = temp2;
					start[0] = temp1;
					int number2 = Integer.parseInt(new String(start));
					if(number2 <= b && number2 >= a && !used[number2] && number1 != number2 && number2 != a) {
						used[a] = true;
						count++;
					}
				}
			}
			System.out.println("Case #" + (i+1) + ": " + count);
		}
	}
}

