#include<bits/stdc++.h>
// #pragma GCC optimize (1)
// #pragma GCC optimize (2)
// #pragma GCC optimize (3)
#define deg(a) cout<<#a<<'='<<a<<"\n"
#define all(a) a.begin(),a.end()
#define lowbit(x)  ((x)&(-x))
#define find1(x)  (__builtin_popcount(x))
#define pll pair<int,int>
#define int long long   
#define endl '\n'
#define ff first
#define ss second
#define lc p<<1
#define rc p<<1|1
using namespace std;
using i64 = long long;
const int N = 2e5 + 10;
const int M = 1e6 + 10;
const int mod1 = 998244353;
const int mod2 = 1e9+7;
const int INF = 0x3f3f3f3f3f3f3f;
const double eps = 1e-10;
void solve(){
     int n,m;
     cin >> n >> m;
     std::vector<double> a(n+1);
     int sum = 0;
     for(int i = 1 ; i <= n ; i++) {
        cin >> a[i];
        sum += a[i];
     }
     for(int i = 1 ; i <= n ; i++) {
        a[i] += a[i] / sum * m;
        cout << a[i] << " "; 
     }
     cout << endl;
     

} 
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int kk = 1;
    cin >> kk;
    while(kk--) {
        solve();
    }
    return 0;
}