#include <bits/stdc++.h>
using namespace std;
int MAX(int a, int b) { return (a > b) ? a : b; }
double FMAX(double a, double b) { return (a > b) ? a : b; }
int MIN(int a, int b) { return (a < b) ? a : b; }
double FMIN(double a, double b) { return (a < b) ? a : b; }
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int UGCD(unsigned long long int a, unsigned long long int b) {
  return b ? GCD(b, a % b) : a;
}
int LCM(int a, int b) { return a / GCD(a, b) * b; }
void fswop(double &a, double &b) {
  double c = a;
  a = b;
  b = c;
}
void swop(int &a, int &b) {
  a = a ^ b;
  b = a ^ b;
  a = a ^ b;
}
long long int u(long long int a) {
  if (a >= 0) return a;
  return a * (-1);
}
int main() {
  int n, i, k, mas[150], mar[150] = {0}, max = 0;
  scanf("%d %d", &n, &k);
  for (i = 0; i < n; i++) {
    scanf("%d", &mas[i]);
    if (mas[i] > max) max = mas[i];
  }
  for (i = 0; i < n; i++) {
    mar[i] = max - mas[i];
    k -= (max - mas[i]);
    mas[i] = max;
    if (k < 0) {
      printf("-1");
      return 0;
    }
  }
  for (i = 0; i < n; i++) {
    printf("%lf\n", (double)mar[i] + (double)k / (double)n);
  }
  return 0;
}
