You are given a string s that consists of the digits '1' to '9' and two integers k and minLength. A partition of s is called beautiful if: Return the number of beautiful partitions of s. Since the answer may be very large, return it modulo 109 + 7. A substring is a contiguous sequence of characters within a string.