import sys
#sys.setrecursionlimit(10 ** 6)
INF = float('inf')
#10**20,2**63に変えるのもあり
MOD = 10**9 + 7
MOD2 = 998244353
from collections import defaultdict
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(input())
    def IC(): return [int(c) for c in input()]
    def MI(): return map(int, sys.stdin.readline().split())
    from functools import reduce
    import math
    def my_lcm_base(x, y):
        return (x * y) // math.gcd(x, y)
    def my_lcm(*numbers):
        return reduce(my_lcm_base, numbers, 1)
    def my_gcd(*numbers):
        return reduce(math.gcd, numbers)
    N,M = MI()
    W = LI()
    GCD = my_gcd(*W)
    if GCD == 0:
        Ans = [0]*N
        print(*Ans)
        exit()
    for n in range(N):
        W[n] = W[n]//GCD
    #print(sum(W))
    SUM = sum(W)
    if SUM == 0:
        Ans = [0]*N
        print(*Ans)
        exit()
    Weight = M//SUM
    Ans = [0]*N
    for n in range(N):
        Ans[n] = W[n]*Weight
    print(*Ans)
    return
solve()