/*
 * 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.FileInputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Scanner;

public class Runner {

	class ll {
		public lln f;
		public lln l;
	}

	class lln {
		public Object v;
		public lln n;
	}

	private static Scanner sc;

	public static int gi() {
		return Integer.parseInt(sc.next());
	}

	public static String gn() {
		return sc.next();
	}

	public static void main(String[] args) throws IOException {
		System.setIn(new FileInputStream("C-small-attempt2.in"));
		System.setOut(new PrintStream("output.txt"));

		sc = new Scanner(System.in);

		int N = gi();

		for (int z = 0; z < N; z++) {

			int o = gi();
			int t = gi();

			int c = 0;

			for (int m = o + 1; m <= t; m++) {
				for (int n = o; n < m; n++) {
					String ms = new Integer(m).toString();
					String ns = new Integer(n).toString();

					ns = ns.substring(ns.length() - 1) + ns.substring(0, ns.length() - 1);

					for (int i = 0; i < ms.length() - 1; i++) {
						//System.out.println("M: " + ms + " N: " + ns);
						if(ns.equals(ms)) {
							c++;
							break;
						}
						//System.out.println("Pre: " + ns + " ms: " + ms);
						ns = ns.substring(ns.length() - 1) + ns.substring(0, ns.length() - 1);
						//System.out.println("Post: " + ns + " i: " + i);
					}
				}
			}

			System.out.format("Case #%d: %d\r\n", z + 1, c);
		}
	}

}
