You are given a string s consisting of digits and a $2 {D}$ integer array queries, where queries[i] = [l_i, r_i].

For each query:
$1$. Consider the substring of s from index l_i to index r_i inclusive.
$2$. Remove all occurrences of the digit $'0'$ from this substring and concatenate the remaining digits in their original order to form an integer x. If there are no non-zero digits, x = 0.
$3$. Compute sum as the sum of all digits in x.
$4$. The answer for the query is $(x \times {sum}) \bmod (10^9 + 7)$.

Return an array of integers where the $i$-th element is the answer to the $i$-th query.

Constraints:

• $1 \leq m ==$ s.length $\leq 10^5$

• s consists of digits only.

• $1 \leq$ queries.length $\leq 10^5$

• queries[i] $= [l_i, r_i]$

• $0 \leq l_i \leq r_i < m$

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.