#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
bool chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
bool chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") {
    cout << (f ? yes : no) << "\n";
}

void solve() {
    int n, k;
    cin >> n >> k;
    vl a(n);
    rep(i, n) cin >> a[i];
    sort(all(a));
    vector<vl> v;
    auto dfs = [&](auto self, int i) {
        if (i == n) {
            if (v.size() < 3) return 0LL;
            double mi = 1e18, ma = -1e18;
            for (auto&& u : v) {
                double sum = accumulate(all(u), (double)0);
                double ave = sum / u.size();
                cout << " " << sum << '\n';
                chmin(mi, ave);
                chmax(ma, ave);
            }
            return ll(ceil(ma - mi) + 0.1);
        }
        ll res = 0;
        if (v.size()) {
            v.back().push_back(a[i]);
            chmax(res, self(self, i + 1));
            v.back().pop_back();
        }
        v.push_back(vl(1, a[i]));
        chmax(res, self(self, i + 1));
        v.pop_back();
        return res;
    };
    ll ans = dfs(dfs, 0);
    cout << ans << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}