hmmmm

from sys import stdin, stdout
import math
import heapq

R = lambda : stdin.readline().strip()
RL = lambda f=None: list(map(f, R().split(' '))) if f else list(R().split(' '))

output = lambda x: stdout.write(str(x) + '\n')
output_list = lambda x: output(' '.join(map(str, x)))

def solve(s):
    arr = 26*[0]
    flg = len(s)*[True]
    for i in range(len(s)):
        if s[i] == '#':
            flg[i], flg[i-1], flg[i-2] = False, False, False
            if i+1<len(s) and s[i+1] == '(':
                prev = i+1
                flg[prev] = False
                while prev<len(s) and s[prev] != ')':
                    prev+=1
                    flg[prev]=False

                arr[int(s[i-2:i]) -1] += int(s[i+2:prev])

            else:
                arr[int(s[i-2:i]) -1] += 1
    for i in range(len(s)):
        if flg[i]:
            arr[int(s[i])-1] += 1
    print(*arr)

s = R()
solve(s)