/*
 * 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.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class C {


	public static void main (String[] args)
	{


		try {
			//BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
			BufferedReader in = new BufferedReader(new InputStreamReader(new FileInputStream(new File("src/C-small-attempt0.in"))));
			PrintWriter pw = new PrintWriter(System.out);
			int cases = Integer.parseInt(in.readLine());	
			for (int i = 0; i < cases; i++) {
				String[] nums = in.readLine().split(" ");
				int A = Integer.parseInt(nums[0]);
				int B = Integer.parseInt(nums[1]);
				int cont = 0;
				if(A!=1000 && A>=10)
				{
					if(A<100)
					{
						for (int j = A; j < B; j++) {
							if(j/10<j%10 && 10*(j%10)+j/10<=B)
								cont++;
						}
					}
					if(A>=100)
					{
						for (int j = A; j < B; j++) {
							int lef = j/100;
							int mid = (j-j/100*100)/10;
							int rig = j%10;
							
							if(lef==mid && lef==rig)
								continue;
							boolean a = lef<mid || (lef==mid && lef<rig);
							boolean b = lef<rig || (lef==rig && mid<lef);
							if(a && mid*100 + rig*10 + lef <=B)
								cont++;
							if(b && rig*100 + lef*10 + mid <=B)
								cont++;
							if(mid*100 + rig*10 + lef == rig*100 + lef*10 + mid )
								cont--;
							
						}

					}
				}
				
				System.out.println("Case #"+(i+1)+": "+cont);
				}

				
			pw.flush();
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
	}
}
