/*
 * 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.*;

public class Test3 {

	final static String INPUT_FILE_NAME = "input3";

	int T = 0;
	int q = 0;

	public static void main(String args[]) {
		try {
			Test3 tst = new Test3();
			tst.getInput();
		}
		catch (Exception e) {
			e.printStackTrace();
		}
	}

	private void getInput() throws Exception {
		File file = new File(INPUT_FILE_NAME);
		FileReader fis = new FileReader(file);
		BufferedReader br = new BufferedReader(fis);
		String strT = br.readLine();
		T = getInt(strT);

		for (int i=0; i<T; i++) {
			String strHead = br.readLine();
			String[] AandB = strHead.split(" ");
			int A = getInt(AandB[0]);
			int B = getInt(AandB[1]);

			//list kakunou
			execuse(i, A, B);
		}
	}

	private void execuse(int t, int A, int B) {
		int rtn = 0;
		int[] counts = new int[B+1];
		for (int i=0; i<=B;i++) {
			counts[i] = 0;
		}

		for (int i=A; i<=B;i++) {
			if (sortNumber(i)>0) {
				counts[sortNumber(i)]++;
			}
		}

		for (int i=0; i<=B;i++) {
//System.out.println("i="+i+" counts="+counts[i]);
			rtn += counts[i] * (counts[i]-1) / 2;
		}

		System.out.println("Case #"+(t+1)+": "+rtn);
		//System.out.println("Hello WorldI");
	}

	private int sortNumber(int i) {
		String str = String.valueOf(i);
		int keta = str.length();

		int min = i;
		String slideStr = str;
		for (int k=0; k<keta; k++) {
			slideStr = slideStr.substring(1)+slideStr.substring(0,1);
			if (min > getInt(slideStr)) {
				min = getInt(slideStr);
			}
		}

		return min;
	}

	private int getInt(String a) {
		return Integer.parseInt(a, 10);
	}

	private int getIntx(String a) {
		if (a.equals(".")) {
			return 0;
		}
		return 1;
	}

}
