#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

vector<int> consistency(int n, int k){

    int maxSum = 0;
    vector<int> b;
    for(int i=0; i<n; i++){
        if(a[i]>=0) maxSum += a[i];
        b.push_back(abs(a[i]));
    }

    sort(begin(b), end(b));


    vector<int> ans = {maxSum};

    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
    pq.push({b[0], 0});

    while(!pq.empty()){
        auto top = pq.top();
        pq.pop();

        int sum = top.first;
        int idx = top.second;
        
        ans.push_back(maxSum-sum);
        if(ans.size() == k) break;

        if(idx+1<n){
            pq.push({sum+b[idx+1], idx+1});
            pq.push({sum-b[idx]+b[idx+1], idx+1});
        }
    }

    return ans;
}















vector<int> practice(int n, int k){


}





void solve() {
    
    int n, k;
    cin>> n >> k;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    auto ans = consistency(n, k);

    for(auto& t : ans){
        cout << t << " ";
    }
    cout << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}