/*
 * 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 codejam.StoreCredit;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedHashSet;
import java.util.Set;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author java
 */
public class RecycledNumbers {

    static BufferedReader in;

    private static void open() {
        in = new BufferedReader(new InputStreamReader(System.in));
    }

    private static void close() {
        try {
            in.close();
        } catch (IOException ex) {
            Logger.getLogger(StoreCredit.class.getName()).log(Level.SEVERE, null, ex);
        }
    }

    private static int readInt() throws IOException {
        Integer i = Integer.parseInt(in.readLine());
        return i;
    }

    private static int[] readInts() throws IOException {
        String[] vals = in.readLine().split(" ");
        int[] arr = new int[vals.length];
        for (int i = 0; i < vals.length; i++) {
            arr[i] = Integer.parseInt(vals[i]);
        }
        return arr;
    }

    public static void main(String[] args) throws IOException {
        open();
        int T = readInt();
        for (int t = 0; t < T; t++) {
            int[] arr = readInts();
            int A = arr[0];
            int B = arr[1];
            Set<Integer> set = new LinkedHashSet<Integer>();
            Set<Integer> additionalSet = new HashSet<Integer>();
            while (A <= B) {
                String v = String.valueOf(A);
                set.add(A);
                A++;
            }
            Iterator<Integer> it = set.iterator();
            Set<String> used = new LinkedHashSet<String>();
            StringBuilder b = new StringBuilder();
            while (it.hasNext()) {
                int val = it.next();
                it.remove();
                b.delete(0, b.length());
                b.append(val);
                int iteration = b.length();
                boolean added = false;
                if (iteration > 1) {
                    for (int i = 0; i < iteration - 1; i++) {
                        char c = b.charAt(0);
                        b.deleteCharAt(0);
                        b.append(c);
                        String newItem = b.toString();

                        // remove leading 0
                        int j = 0;
//                    for (; j < newItem.length() && newItem.charAt(j) == '0'; j++);
//                    newItem = newItem.sub1string(j);
                        int newNumber = Integer.parseInt(newItem);
                        if ((set.contains(newNumber)
                                || additionalSet.contains(newNumber)) && !used.contains(val + "#" + newNumber)) {
                            used.add(val + "#" + newNumber);
                            added = true;
                        }
                    }
                }
                if (!added) {
                    additionalSet.add(val);
                }

            }
            System.out.println("Case #" + (t + 1) + ": " + used.size());
//        System.out.println(used);
        }
        close();
    }
}
