Please solve the programming task below using a self-contained code snippet in a markdown code block.

You are given an array of integers nums (0-indexed) and an integer k.
The score of a subarray (i, j) is defined as min(nums[i], nums[i+1], ..., nums[j]) * (j - i + 1). A good subarray is a subarray where i <= k <= j.
Return the maximum possible score of a good subarray.
 
Please complete the following python code precisely:
```python
class Solution:
    def maximumScore(self, nums: List[int], k: int) -> int:
```