/*

Author: Haze

2024/4/24

*/

#include <bits/stdc++.h>

#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
using ll = long long;
#define int ll

#define debugs(x) cerr<<#x<<" "<<x<<endl;
//const int mod = 1000000000 + 7;
//const int itinf = 1000000999;
//const ll llinf = 2e18;
//const int N = 500099;

void solve() {
    int n, x;
    cin >> n >> x;
    int sums = 0;
    vector<int> arr(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> arr[i];
        sums += arr[i] * arr[i];
//        debugs(sums);
    }
    if(x==0){
        for (int i = 1; i <= n; i++){
            printf("0 ");
        }
        return;
    }
    long double t = sums * 1.0 / (1.0 * (x * n));
//    printf("%lld\n", sums);

    t = sqrt(t);
//    printf("%.8Lf", t);
    for (int i = 1; i <= n; i++) {
//        if()
//        debugs(t);
        if (t == 0)
            printf("0 ");
        else
            printf("%.14Lf ", (1.0 * arr[i]) / t);
    }
}

signed main() {
//    IOS
    int T = 1;
    while (T--) {
        solve();
    }
    return 0;
}