/*
 * 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.*;
class Replace
{
	public static void main(String args[])throws Exception
	{
		//Scanner sc = new Scanner(System.in);
		// PrintWriter pw = new PrintWriter(System.out);
		Scanner sc = new Scanner(new FileReader("C-small-attempt1.in"));
		//Console console=System.console(new FileReader("B-small-practice-1.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("C-small-attempt1.out"));
		int ntest = sc.nextInt();
		//int a=100;
		//int b=500;
		
		for(int k=1;k<=ntest;k++)
		{
		int sum=0;
		int count=0;
		//int a=Integer.parseInt(sc.next());
		//int b=Integer.parseInt(sc.next());
		int a=sc.nextInt();
		int b=sc.nextInt();
		
		for(int i=a;i<=b;i++)
		{
				if(i>0 && i<100)
				{
					int rem=i%10;
					sum=rem*10+i/10;
					if(sum==i)
					{
					}
					else if(sum>=a && sum<=b)
					{
						count++;
						System.out.println(i);
						//System.out.println("garg");
					}
				}
				if(i>=100 && i<1000)
				{
					int rem=i%100;
					sum=rem*10+i/100;
					//System.out.println(i);
					
					if(sum==i)
					{
					}
					else if (sum>=a && sum<=b)
					{
						count++;
						//System.out.println(i);
					}
					//System.out.println("lucky");
					rem=i%10;
					sum=rem*100+i/10;
					if(sum==i)
					{
					}
					else if(sum>=a && sum<=b)
					{
						count++;
						//System.out.println(i);
						//System.out.println("garg");
					}
				}
					
					
				
		}
		pw.print("Case #" + k + ": ");
		pw.print(count/2);
		pw.println();
		}
		pw.close();
		sc.close();
	}
}