import sys sys.setrecursionlimit(10 ** 6) from bisect import * from collections import * from heapq import * int1 = lambda x: int(x) - 1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def SI(): return sys.stdin.readline()[:-1] def MI(): return map(int, sys.stdin.readline().split()) def MI1(): return map(int1, sys.stdin.readline().split()) def MF(): return map(float, sys.stdin.readline().split()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LF(): return list(map(float, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] dij = [(0, 1), (1, 0), (0, -1), (-1, 0)] def main(): def cal(co): for a in range(cx,cx-cd,-1):co*=a ans[cx-cd]+=co return 0,0 n = II() d = II() s = SI() ans=[0]*(d+1) cd=cx=co=0 for c in s: if c=="d": cd+=1 if c=="}": cx,co=cal(co) cd-=1 if c=="x": cx+=1 if not co:co=1 if c.isdigit(): co=int(c) if c=="+": cx,co=cal(co) #print(c,ans,cd,cx,co) if co:cal(co) print(*ans) main()