import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
import java.util.*;

public class Recycle
{
    public static void main(String args[])
    {
        int uBound, lBound, count=0, caseNo=1;

        Scanner input = new Scanner(System.in);

        input.nextLine();

        while(true)
        {
            lBound = input.nextInt();
            uBound = input.nextInt();

            for(int i=lBound; i<=uBound; i++)
            {
                int numDigits = new Integer(i).toString().length();
                int[] pastPairs = new int[numDigits-1];
                for(int j=1; j<numDigits; j++)
                {
                    int rotatedInt = rotateInt(i,j);
                    if(rotatedInt>i && rotatedInt<=uBound)
                    {
                        for(int k=0; k<numDigits-1; k++)
                        {
                            if(rotatedInt==pastPairs[k])
                            {
                                count--;
                            }
                        }
                        count++;
                    }
                    pastPairs[j-1] = rotatedInt;
                }
            }
            System.out.printf("Case #%d: %d\n",caseNo,count);
            count=0; caseNo++;
        }
    }

    static int rotateInt(int number, int rotate)
    {
        String numStr = new Integer(number).toString();
        String last = numStr.substring(numStr.length()-rotate);
        String rest = numStr.substring(0,numStr.length()-rotate);
        numStr = last.concat(rest);
        return Integer.parseInt(numStr);
    }
}

// Called with java Recycle < in.in > out.txt
