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


public class C {
	public static HashSet<Integer> used;
	public static void main(String[] args) throws IOException {
		PrintWriter out = new PrintWriter(new File("C.out"));
		Scanner in = new Scanner(System.in);
		int cases = in.nextInt();
		used = new HashSet<Integer>();
		for(int caseOn = 1; caseOn <= cases; caseOn++) {
			used.clear();
			int a = in.nextInt();
			int b = in.nextInt();
			
			int ans = 0;
			for(int i = a; i < b; i++) {
				if(used.contains(i))
					continue;
				int count = 0;
				ArrayList<Integer> rotations = gen(i);
				for(int t : rotations) {
					if(!used.contains(t)) {
						used.add(t);
						if(a <= t && t <= b) {
							count++;
						}
					}
				}
				count--;
				ans+=(count*(count+1))/2;
			}
			out.printf("Case #%d: %d\n",caseOn,ans);
		}
		out.close();
	}
	
	public static ArrayList<Integer> gen(int a) {
		int dig = countDigits(a);
		int ten = 1;
		for(int i = 1; i < dig; i++) {
			ten*=10;
		}
		ArrayList<Integer> ret = new ArrayList<Integer>();
		for(int i = 0; i < dig; i++) {
			if(countDigits(a)==dig)
				ret.add(a);
			a = (a%10)*ten + (a/10);
		}
		return ret;
	}
	
	public static int countDigits(int a) {
		int c = 0;
		while(a!=0) {
			c++;
			a/=10;
		}
		return c;
	}
}
/*

4
1 9
10 40
100 500
1111 2222


*/
