#include <bits/stdc++.h>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> s;
using i64 = long long;
// using u32 = unsigned int;
// using u64 = unsigned long long;
// using i128 = __int128_t;
using namespace std;
const int N = 2e5 + 5;
// const int B = 455;
// const int M = 2e6 + 5;
// const int base = 13131;
// const int base = 17171;
// const int mod = 998244353;
const int mod = 1e9 + 7;
// const i64 mod = 1000000000000000003LL;
// const double pi = acos(-1);

int n, k, a[N];
void solve()
{
    cin >> n >> k;
    i64 sum = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (a[i] < 0)
            sum += a[i], a[i] = -a[i];
    }
    sort(a + 1, a + n + 1);
    bool flag = true;
    if (sum < 0)
    {
        cout << sum << '\n';
        k--;
        flag = false;
    }
    priority_queue<pair<i64, int>, vector<pair<i64, int>>, greater<pair<i64, int>>> que;
    que.push({a[1], 1});
    while (k--)
    {
        auto [v, cur] = que.top();
        que.pop();
        if (!flag && v + sum == 0)
            flag = true, k++;
        else
            cout << v + sum << '\n';
        if (cur < n)
            que.push({v + a[cur + 1], cur + 1}),
                que.push({v + a[cur + 1] - a[cur], cur + 1});
    }
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    cout << fixed << setprecision(10);
    while (t--)
        solve();
}