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

Given an integer array nums, return the sum of floor(nums[i] / nums[j]) for all pairs of indices 0 <= i, j < nums.length in the array. Since the answer may be too large, return it modulo 109 + 7.
The floor() function returns the integer part of the division.
 
Please complete the following python code precisely:
```python
class Solution:
    def sumOfFlooredPairs(self, nums: List[int]) -> int:
```