You are given a string s consisting of digits from '$1'$ to '$9'$, and two integers k and minLength.

A partition of s is called beautiful if:

• s is divided into exactly k contiguous, non empty substrings.

• Each substring has a length of at least minLength.

• The first character of each substring is a prime digit ('$2'$, '$3'$, '$5'$, or '$7'$).

• The last character of each substring is a non prime digit ('$1'$, '$4'$, '$6'$, '$8'$, or '$9'$).

Return the total number of beautiful partitions of s. Since the answer may be very large, return it modulo $10^9 + 7$.

Constraints:

• $1 \leq$ k, minLength $\leq$ s.length $\leq 1000$

• s consists of the digits '$1'$ to '$9'$.

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.