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

The product difference between two pairs (a, b) and (c, d) is defined as (a * b) - (c * d).

For example, the product difference between (5, 6) and (2, 7) is (5 * 6) - (2 * 7) = 16.

Given an integer array nums, choose four distinct indices w, x, y, and z such that the product difference between pairs (nums[w], nums[x]) and (nums[y], nums[z]) is maximized.
Return the maximum such product difference.
 
Please complete the following python code precisely:
```python
class Solution:
    def maxProductDifference(self, nums: List[int]) -> int:
```