/*
 * 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.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/*
 * To change this template, choose Tools | Templates and open the template in
 * the editor.
 */
/**
 *
 * @author megaterik
 */
public class C {

    public static void main(String[] args) throws FileNotFoundException {
        new C().solve();
    }
    
    int[] lastAchivement;
    int calculate(int x, int a, int b)
    {
        String s = Integer.toString(x);
        int res = 0;
        for (int i = 0; i < s.length(); i++)
        {
            int val = Integer.parseInt(s.substring(i).concat(s.substring(0, i)));
            if (val >= a && val <= b && !s.substring(i).concat(s.substring(0, i)).startsWith("0") && val > x && lastAchivement[val] != x)
            {
                res++;
                lastAchivement[val] = x;
              //  out.println(x + " and " + val);
            }
        }
        return res;
    }
    
    PrintWriter out;

    void solve() throws FileNotFoundException {
        Scanner in = new Scanner(new FileReader("src/input.txt"));
        out = new PrintWriter(new FileOutputStream("src/output.txt"));;
        int testCases = in.nextInt();
        for (int t = 1; t <= testCases; t++) {
            int a = in.nextInt();
            int b = in.nextInt();
            lastAchivement = new int[b + 1];
            int res = 0;
            for (int i = a; i <= b; i++)
                res += calculate(i, a, b);
            out.println("Case #" + t + ": " + res);
        }
        in.close();
        out.close();
    }
}
