import sys
n = input()
d = input()
s = raw_input()+"$"

sys.setrecursionlimit(500000)

def parseS(cur):
    ret = [0]*(d+1)
    while 1:
        cur, res = parseE(cur)
        for i in xrange(d+1):
            ret[i] += res[i]
        if s[cur]!="+":
            break
        cur += 1
    return cur, ret
def parseE(cur):
    ret = [0]*(d+1)
    ret[0] = 1
    while 1:
        cur, res = parseP(cur)
        ret = [sum(ret[j]*res[i-j] for j in xrange(i+1)) for i in xrange(d+1)]
        if s[cur]!="*":
            break
        cur += 1
    return cur, ret
def parseP(cur):
    if s[cur]=="x":
        # x
        ret = [0]*(d+1); ret[1] = 1
        return cur+1, ret
    elif s[cur]=="d":
        # d{T}
        cur, res = parseS(cur+2)
        ret = [i*res[i] for i in xrange(1, d+1)] + [0]
        return cur+1, ret
    else:
        # 1~9
        ret = [0]*(d+1); ret[0] = int(s[cur])
        return cur+1, ret

cur, ans = parseS(0)
print " ".join(map(str, ans))