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

The width of a sequence is the difference between the maximum and minimum elements in the sequence.
Given an array of integers nums, return the sum of the widths of all the non-empty subsequences of nums. Since the answer may be very large, return it modulo 109 + 7.
A subsequence is a sequence that can be derived from an array by deleting some or no elements without changing the order of the remaining elements. For example, [3,6,2,7] is a subsequence of the array [0,3,1,6,2,2,7].
 
Please complete the following python code precisely:
```python
class Solution:
    def sumSubseqWidths(self, nums: List[int]) -> int:
```