/*
 * 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;
import java.util.Set;
import java.util.TreeSet;

public class C {
	public static void main(String args[]) {
		new C();
	}

	public C() {
		Scanner in = new Scanner(System.in);

		int T = in.nextInt();
		for(int x=1; x<=T; x++) {
			int a = in.nextInt();
			int b = in.nextInt();

			int y = 0;
			for(int n=a; n<=b; n++) {
				y += check(n, b);
			}

			System.out.printf("Case #%d: %d\n", x, y);
		}
	}

	public int check(int n, int b) {
		String s = Integer.toString(n);
		int nd = s.length();

		Set<Integer> set = new TreeSet<Integer>();
		int ret = 0;
		for(int d=1; d<nd; d++) {
			String ms = s.substring(nd-d) + s.substring(0, nd-d);
			int m = Integer.parseInt(ms);
			if(n < m && m <= b) {
				if(set.contains(m)) continue;

				ret++;
				set.add(m);
			}
		}

		return ret;
	}
}