I am happy that i did it alone
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def findXSum(self, nums: List[int], k: int, x: int) -> List[int]:
        i=0
        ans=[]
        while i+k<=len(nums):
            count = Counter(nums[i:i+k])
            hps = []
            for k1,v in count.items():
                heapq.heappush(hps,(-v,-k1))
            res = 0
            for j in range(x):
                if hps:
                    v,k1 = heapq.heappop(hps)
                    res += k1*v
            ans.append(res)
            i+=1
        return ans

```
['Python3']