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

For an integer array nums, an inverse pair is a pair of integers [i, j] where 0 <= i < j < nums.length and nums[i] > nums[j].
Given two integers n and k, return the number of different arrays consisting of numbers from 1 to n such that there are exactly k inverse pairs. Since the answer can be huge, return it modulo 109 + 7.
 
Please complete the following python code precisely:
```python
class Solution:
    def kInversePairs(self, n: int, k: int) -> int:
```