You are given two positive integers left and right. Calculate the product of all integers in the inclusive range $[$left, right$]$.

Since the product can be very large, abbreviate it according to the following procedure:

1. Count the total number of trailing zeros in the product, denoted as $C$, and remove all trailing zeros.

2. Let $d$ be the number of remaining digits.

   • If $d \leq 10$, let $S$ be the string representing the remaining number.

   • If $d > 10$, let $S$ be the concatenation of the first $5$ digits of the remaining number, the substring ..., and the last $5$ digits of the remaining number.

3. Concatenate $S$, the character e, and the count $C$ to form the final result <S>e<C>.

Return the string representing the abbreviated product.

Constraints:

• $1 \leq$ left $\leq$ right $\leq 10^4$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.