#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct {
    int value;
    int count;
} FreqItem;

int compare(const void* a, const void* b) {
    FreqItem* fa = (FreqItem*)a;
    FreqItem* fb = (FreqItem*)b;
    if (fa->count != fb->count) {
        return fb->count - fa->count;
    }
    return fb->value - fa->value;
}

long long* findXSum(int* nums, int numsSize, int k, int x, int* returnSize) {
    *returnSize = numsSize - k + 1;
    long long* result = (long long*)malloc(sizeof(long long) * (*returnSize));
    
    for (int i = 0; i <= numsSize - k; i++) {
        int freq[4001] = {0}; // Extended range for values
        FreqItem items[k];
        int itemCount = 0;
        
        // Count frequencies for current window
        for (int j = i; j < i + k; j++) {
            freq[nums[j] + 2000]++; // Offset for negative numbers
        }
        
        // Build items array
        for (int val = -2000; val <= 2000; val++) {
            if (freq[val + 2000] > 0) {
                items[itemCount].value = val;
                items[itemCount].count = freq[val + 2000];
                itemCount++;
            }
        }
        
        qsort(items, itemCount, sizeof(FreqItem), compare);
        
        long long xSum = 0;
        int limit = (x < itemCount) ? x : itemCount;
        for (int idx = 0; idx < limit; idx++) {
            xSum += (long long)items[idx].value * items[idx].count;
        }
        
        result[i] = xSum;
    }
    
    return result;
}

int main() {
    // Parse input and call solution
    return 0;
}