#include <bits/stdc++.h>
using namespace std;
int inline ABS(int a) {
  if (a > 0)
    return a;
  else
    return -a;
}
int GCD(int a, int b) {
  if (!a) return b;
  return GCD(b % a, a);
}
int a[222];
double ans[222];
int main() {
  int b, n;
  cin >> n >> b;
  for (int i = 0; i < n; i++) cin >> a[i];
  int mx = 0;
  for (int i = 0; i < n; i++) mx = max(mx, a[i]);
  int p = 0;
  for (int i = 0; i < n; i++) p = p + mx - a[i];
  if (b < p) {
    puts("-1");
    return 0;
  }
  for (int i = 0; i < n; i++) ans[i] = mx;
  b -= p;
  for (int i = 0; i < n; i++) ans[i] = ans[i] + (double)b / (double)n;
  for (int i = 0; i < n; i++) printf("%.10lf\n", ans[i] - (double)a[i]);
  return 0;
}
