import sys
sys.setrecursionlimit(10**7)

N=int(input())
d=int(input())
S=input().strip()

D=[-1]*N

Q=[]
for i in range(len(S)):
    if S[i]=="d":
        Q.append(i)
    elif S[i]=="}":
        D[Q[-1]]=i
        Q.pop()
    
def calc(L,R):
    ANS=[0]*12

    ind=L
    score=1
    dim=0
    
    while ind<=R:
        #print(ANS,ind)
        if S[ind]=="d":
            x=D[ind]
            
            X=diff(calc(ind+2,x-1))

            for i in range(len(X)):
                ANS[i]+=X[i]

            ind=x+1
            score=1
            dim=0
            if ind<len(S) and S[ind]=="+":
                ind+=1

        elif S[ind]=="x":
            dim+=1
            
            if ind+1<len(S) and S[ind+1]=="*":
                ind+=2
            else:
                ind+=1

        elif "1"<=S[ind]<="9":
            x=int(S[ind])
            score*=x
            if ind+1<len(S) and S[ind+1]=="*":
                ind+=2
            else:
                ind+=1

        else:
            ANS[dim]+=score
            score=1
            dim=0
            ind+=1

        if ind==R+1 and S[ind-1]!="}":
            ANS[dim]+=score
            break

    return ANS
  

def diff(A):
    #print("!",A)
    ANS=[0]*(len(A)-1)

    for i in range(len(A)):
        ANS[i-1]=i*A[i]

    #print(ANS)

    return ANS
        

print(*calc(0,len(S)-1)[:d+1])