#include <bits/stdc++.h>
const int MAXN = 1111;
int a[MAXN], b, m = 0;
int n;
int main(void) {
  scanf("%d%d", &n, &b);
  for (int i = 1; i <= n; i++) {
    scanf("%d", a + i);
    m = std::max(m, a[i]);
  }
  int sum = 0;
  for (int i = 1; i <= n; i++) {
    sum += m - a[i];
  }
  if (sum > b) {
    puts("-1");
  } else {
    b -= sum;
    double t = (double)b / (double)n;
    for (int i = 1; i <= n; i++) {
      printf("%lf\n", t + m - a[i]);
    }
  }
  return 0;
}
