import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.util.*;

public class RecycledNumbers {
    private final int A;
    private final int B;
    private final boolean[] allNumbers;

    public RecycledNumbers(int A, int B) {
        this.A = A;
        this.B = B;
        //numbers are A + i, where i is the array index
        allNumbers = new boolean[B - A + 1];
    }

    public int getDistinctPairsCount() {
        int distinctPairs = 0;
        for (int i = 0; i < allNumbers.length; i++) {
            if (!allNumbers[i]) {
                int number = indexToNumber(i);
                Set<String> recyclings = (number > 9) ? getRecyclings(number) : Collections.<String>emptySet();
                if (!recyclings.isEmpty()) ignore(recyclings);
                int numberOfDistinctPairs = recyclings.isEmpty() ? 0 : getNumberOfDistinctPairs(recyclings);
                distinctPairs += numberOfDistinctPairs;
            }
        }
        return distinctPairs;
    }

    private int getNumberOfDistinctPairs(Set<String> recyclings) {
        int recyclingsThatCount = 0;
        for (String s : recyclings) {
            int number = Integer.parseInt(s);
            if (withinBounds(number) && doesntStartWithZero(s))
                recyclingsThatCount++;
        }

        int pairs = recyclingsThatCount * (recyclingsThatCount - 1) / 2;
        return pairs;
    }

    private boolean doesntStartWithZero(String s) {
        boolean result = s.charAt(0) != '0';
        return result;
    }

    private boolean withinBounds(int number) {
        boolean result = number >= A && number <= B;
        return result;
    }

    private void ignore(Set<String> recyclings) {
        //set them to true in the array
        for (String s : recyclings) {
            int number = Integer.parseInt(s);
            if (withinBounds(number))
                allNumbers[numberToIndex(number)] = true;
        }
    }

    private int numberToIndex(int number) {
        return number - A;
    }

    private int indexToNumber(int i) {
        return i + A;
    }

    private Set<String> getRecyclings(int number) {
        String numberAsString = Integer.toString(number);
        int totalDigits = numberAsString.length();
        Set recyclings = new HashSet<String>();
        for (int i = totalDigits - 1; i >= 0; i--) {
            recyclings.add(numberAsString.substring(i, totalDigits) + numberAsString.substring(0, i));
        }
        return recyclings;
    }


}
