#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
double a[200];
void solve(int n) {
  int i, r, l, j, k, t;
  double b, s, m = 0;
  scanf("%lf", &b);
  for (i = 0; i < n; i++) {
    scanf("%lf", &a[i]);
    m = max(m, a[i]);
  }
  s = 0;
  for (i = 0; i < n; i++) s += m - a[i];
  if (b < s) {
    printf("-1");
    return;
  }
  for (i = 0; i < n; i++) printf("%.8lf\n", m - a[i] + (b - s) / n);
}
int main() {
  int n, m, x, y, i, j, q = 0;
  while (scanf("%d", &n) != EOF) {
    solve(n);
    printf("\n");
  }
  return 0;
}
