#include <bits/stdc++.h> #define MAXN 6005 using namespace std; int n, k, maxx; int a[MAXN], s[MAXN], pre[MAXN], trace[MAXN]; vector<pair<int, int> > res; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; s[i] = k; } for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i]; trace[0] = -1; for (int i = 0; i <= n; i++) for (int j = i + 1; j <= n; j++) if (pre[j] - pre[i] <= k && s[j] > max(s[i], k - (pre[j] - pre[i]))) { s[j] = max(s[i], k - (pre[j] - pre[i])); trace[j] = i; } for (int i = n; i >= 0; i = trace[i]) res.push_back({ trace[i] + 1, i }); res.pop_back(); reverse(res.begin(), res.end()); for (auto i : res) for (int j = i.first; j <= i.second; j++) if (j != i.second) cout << a[j] << " "; else cout << a[j] << "\n"; }