/*
 * 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.PrintWriter;
import java.util.Scanner;


public class RecycledNumbers {

	/**
	 * @param args
	 * @throws Exception 
	 */
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("C-small-attempt0.in"));
		PrintWriter pw = new PrintWriter("C-small.out");
		
		int tc = sc.nextInt();
		for(int t=1; t<=tc; t++){
			int A = sc.nextInt();
			int B = sc.nextInt();
			pw.println("Case #" + t + ": " + count(A,B));
		}
		pw.close();
		sc.close();
	}

	private static long count(int a, int b) {
		boolean[] flag = new boolean[b-a+1];
		long gsum = 0;
		for(int v=Math.max(a, 12); v<b; v++){
			long sum = 1;
			int i = v;
			if(flag[i-a]) continue;
			int exp = 1;
			while(i>0){
				i/=10;
				exp *= 10;
			}
			i = v;
			for(int e=10; e<exp; e*=10){
				int right = i%e;
				if(right < (e/10)) continue;
				int left = i/e;
				int num = right * (exp/e) + left;
				if(num == i) break;
				if(num >= a && num <= b){
					flag[num-a] = true;
					sum++;
				}
			}
			gsum += (sum*(sum-1)/2);
		}
		return gsum;
	}

}
