1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

int main() {
  cin.tie(0)->sync_with_stdio(0);

  int n, m;
  cin >> n >> m;
  vector<int> a(n);
  for(int i = 0; i < n; i++) cin >> a[i];

  vector<pair<int, int>> res;
  for(int i = n - 1; i >= 0; i--) {
    vector<pair<int, int>> nres = res;
    for(int j = 0; j < nres.size(); j++) {
      if(nres[j].first != -1) {
        nres[j].first += a[-nres[j].second];
      }
    }
    sort(all(nres));
    int left = n - i;
    int good = (left - 1) / 2;
    int sum = 0;
    for(int j = 0; j < good; j++) {
      if(nres[j].first == -1) nres[j].first = 0;
      else sum += nres[j].first;
    }
    if(sum > m) res.push_back({-1, -i});
    else {
      for(int j = good; j < nres.size(); j++) {
        nres[j].first = 0;
      }
      nres.push_back({m - sum, -i});
      res = nres;
    }
  }

  vector<int> ans(n);
  for(int i = 0; i < n; i++) {
    ans[-res[i].second] = res[i].first;
  }
  for(int i = 0; i < n; i++) {
    if(i) cout << " ";
    cout << ans[i];
  }
  cout << endl;
}