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
#include <bits/stdc++.h>
using namespace std;
const int MX=50050;
int n,m,a[MX],b[MX],c[MX],idx[MX],was[MX];
bool cmp(int i, int j) {
  if (b[i]!=b[j]) return b[i]<b[j];
  return i>j;
}
int main() {
  scanf("%d%d",&n,&m);
  for (int i=1; i<=n; i++) {
    scanf("%d",&a[i]);
    idx[n-i]=i;
  }
  if (n<=2) {
    printf("%d",m);
    puts((n==2)?" 0":"");
    return 0;
  }
  c[n-1]=m;
  c[n]=0;
  b[n-1]=m+a[n-1];
  b[n]=a[n];
  for (int i=n-2; i>0; i--) {
    int cnt=n-i,x=(cnt+1)-(cnt+1)/2-1,need=0;
    sort(idx,idx+cnt,cmp);
    for (int j=0; j<x && need<=m; j++) {
      was[idx[j]]=i;
      need+=b[idx[j]];
    }
    /*for (int j=i+1; j<=n; j++) printf("%d,",a[j]); puts("a");
    for (int j=i+1; j<=n; j++) printf("%d,",b[j]); puts("b");
    for (int j=i+1; j<=n; j++) printf("%d,",c[j]); puts("c");
    printf("need=%d\n",need);*/
    if (need<=m) {
      c[i]=m-need;
      b[i]=c[i]+a[i];
      for (int j=i+1; j<=n; j++) {
        c[j]=(was[j]==i)?b[j]:0;
        b[j]=c[j]+a[j];
      }
    } else c[i]=-1;
  }
  for (int i=1; i<=n; i++) printf("%d%c",c[i],(i==n)?'\n':' ');
  return 0;
}