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

public class prob_3 {

	public static void main(String[] args) {

		Scanner in = new Scanner(System.in);
		int cases = in.nextInt();

		for (int index = 0; index < cases; index++) {
			int A = in.nextInt();
			int B = in.nextInt();
			int possiblePermutations = (A + "").length() - 1;

			String parse;
			int count = 0;
			int m;

			int[] perms;
			for (int n = A; n < B; n++) {
				perms = new int[possiblePermutations];
				for (int i = 0; i < possiblePermutations; i++) {
					parse = n + "";
					parse = parse.substring(i + 1) + parse.substring(0, i + 1);
					m = Integer.parseInt(parse);
					perms[i] = m;
					if ((n < m) && (m <= B))
						if (counted(perms, i))
							count++;
				}
			}
			System.out.println("Case #" + (index + 1) + ": " + count);
		}
	}

	private static boolean counted(int[] perms, int i) {
		for (int j = 0; j < i; j++)
			if (perms[i] == perms[j])
				return false;

		return true;
	}
}