Python Solution
\nclass Solution:\n    def sumOfFlooredPairs(self, nums: List[int]) -> int:\n        maxx, ans=max(nums), 0\n        counts=[0]*((maxx*2)+1)\n        for i in n
```\nclass Solution:\n    def sumOfFlooredPairs(self, nums: List[int]) -> int:\n        maxx, ans=max(nums), 0\n        counts=[0]*((maxx*2)+1)\n        for i in nums: counts[i]+=1\n        for i in range(1, len(counts)): counts[i]+=counts[i-1]\n        for num in nums:\n            l,r,tba=num, (num*2)-1,1\n            while l<=maxx:\n                ans+=tba*(counts[r]-counts[l-1])\n                tba+=1\n                l+=num\n                r+=num\n        return ans%1000000007\n```
[]