#include <bits/stdc++.h>
using namespace std;
const int N = 100;
const long long mod = 1e9 + 7;
vector<int> e[N];
int vis[N];
void dfs(int i, int p, int count) {}
bool comp(pair<long long, long long>& a, pair<long long, long long>& b) {
  return a.first > b.first && a.second < b.second;
}
long long binpow(long long a, long long b) {
  if (b == 0) return 1;
  if (a == 0) return 0;
  if (b == 1) return a % mod;
  long long g = (binpow(a, b / 2) % mod) * (binpow(a, b / 2) % mod);
  g %= mod;
  if (b & 1)
    return a * g;
  else
    return g;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  while (T--) {
    int n, b;
    cin >> n >> b;
    int a[n], g = 0;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      b += a[i];
      g = max(g, a[i]);
    }
    long double c = (long double)b / (long double)n;
    if (g > c)
      cout << -1 << endl;
    else {
      for (int i = 0; i < n; i++) cout << setprecision(20) << c - a[i] << endl;
    }
  }
}
