/*
 * 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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class C {
    static final int MAX_N = 2000000;
    static int[][] precalc;
    static {
        precalc = new int[MAX_N + 1][];
        List<Integer> values = new ArrayList<Integer>();
        for (int i = 1, deg = 1; i <= MAX_N; ++i) {
            if (i == deg * 10) {
                deg *= 10;
            }
            values.clear();
            int curr = (i % 10) * deg + (i / 10);
            while (curr != i) {
                if (curr > i) {
                    values.add(curr);
                }
                curr = (curr % 10) * deg + (curr / 10);
            }
            int[] z = new int[values.size()];
            for (int j = 0; j < z.length; ++j) {
                z[j] = values.get(j);
            }
            precalc[i] = z;
        }
    }

    public void run(Scanner in, PrintWriter out, int nCase) {
        int min = in.nextInt();
        int max = in.nextInt();
        int count = 0;
        for (int i = min; i <= max; ++i) {
            for (int j : precalc[i]) {
                if (j <= max) {
                    ++count;
                }
            }
        }
        out.printf("Case #%d: %d%n", nCase, count);
    }

    public static void main(String[] args) throws FileNotFoundException {
        String filename = C.class.getSimpleName().toLowerCase();

        Scanner in = new Scanner(new File(filename + ".in"));
        PrintWriter out = new PrintWriter(filename + ".out");

        int nCases = in.nextInt();

        for (int i = 1; i <= nCases; ++i) {
            new C().run(in, out, i);
        }

        out.close();
        in.close();
    }
}
