#include <bits/stdc++.h>
using namespace std;
int solve(long long int a[], long long int x, long long int n) {
  vector<long long int> v;
  for (int i = 1; i <= n; i++) {
    if (x == a[i]) {
      v.push_back(i);
    }
  }
  sort(v.begin(), v.end());
  return abs(v[0] - v[v.size() - 1]);
}
int main() {
  ios_base::sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  int sum = 0;
  int a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    sum += a[i];
  }
  sum += m;
  double l = (double)sum / (double)n;
  double k = (double)n;
  double s = (double)sum;
  int flag = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] > l) {
      cout << "-1";
      flag = 1;
      return 0;
    }
  }
  if (flag == 0) {
    for (int i = 0; i < n; i++) {
      double p = (double)a[i];
      double r = l - p;
      printf("%0.6lf\n", r);
    }
  }
}
