/*
 * 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.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Scanner;

class c {
	public static void main(String[] args) throws FileNotFoundException {
		
		Scanner in = new Scanner(new File("1.in"));
		PrintStream out = new PrintStream(new File("1.out"));
		int T = Integer.parseInt(in.nextLine());

		for (int tt = 0; tt < T; tt++) {

			int a=in.nextInt(),b=in.nextInt();
			HashSet<Long> sols=new HashSet<Long>();
			for(int n=a;n<=b;n++)
			{

				String str="";
				str+=n;
				int len=str.length();
				for(int j=1;j<len;j++)
				{
					
					int p1,p2,m;
					p1=Integer.parseInt(str.substring(0,j));
					p2=Integer.parseInt(str.substring(j));
					m=p1=Integer.parseInt(""+p2+p1);
					if(m>n && m<=b )
						sols.add(n*2000001l+m);
				}
			}
			out.printf("Case #%d: %d\n", tt + 1, sols.size());

		}
	}
}