#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
using namespace std;
int N,M;
long long W[1000];
void solve()
{
	cin >> N >> M;
	long long S = 0;
	for(int i = 0;i < N;i++) cin >> W[i],S += W[i];
	for(int i = 0;i < N;i++) cout << M*W[i]/S << (i+1 == N ? "\n":" ");
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}