
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package codejam;

public class CodeJam {

    public ReadWriteTextFile rw = new ReadWriteTextFile();

    public int countDigits(int number) {
        int numberOfDigits = 0;
        while (number > 0) {
            number = number / 10;

            numberOfDigits++;
        }
        return numberOfDigits;
    }

    public int multiplyIndex(int count) {
        int multiplyIndex = 1;
        for (int i = 1;i < count;i++) {
            multiplyIndex *= 10;
        }

        return multiplyIndex;
    }

    public boolean isRecycled(int firstNumber, int secondNumber) {
        int firstLength = countDigits(firstNumber);
        int secondLength = countDigits(secondNumber);

        if (firstLength != secondLength) {
            return false;
        }

        int multiplyingIndex = multiplyIndex(firstLength);

        for (int i = 1; i < firstLength; i++) {
            secondNumber = secondNumber / 10 + (secondNumber % 10) * multiplyingIndex;

            if (firstNumber == secondNumber) {
              
                return true;
            }


        }

        return false;
    }

    public static void main(String[] args) {
        CodeJam codeJam = new CodeJam();

        int sampleSize = codeJam.rw.readIntLine();


        for (int i = 0; i < sampleSize; i++) {
            int c = 0;
            int firstNumber = codeJam.rw.readInt();
            int secondNumber = codeJam.rw.readInt();
            int recycledNumberCount = 0;
            for (; firstNumber < secondNumber; firstNumber++) {
                int currentFirstPair = firstNumber;
                for (int j = 1; currentFirstPair + j <= secondNumber; j++) {
                    if (codeJam.isRecycled(currentFirstPair, currentFirstPair + j))
                            recycledNumberCount++;
                }


            }
            codeJam.rw.writeNextLine(recycledNumberCount);
        }
        codeJam.rw.close();
    }
}
