N, K = map(int, input().split())
S = input()


def is_balanced(s: str) -> bool:
    d = 0
    for c in S:
        if c == '(':
            d += 1
        elif c == ')':
            if d == 0:
                return False
            d -= 1

    return d == 0


def solve(k: int, s: str):
    if not is_balanced(s):
        print('No')
        return

    st = []
    for c in S:
        if c == '(':
            if len(st) == 0:
                st.append(c)
            elif st[-1] == ')':
                st.append('+')
                st.append(c)
            elif st[-1] == '(':
                st.append('1+')
                st.append(c)
            else:
                assert False
        elif c == ')':
            if st[-1] == '(':
                st.append('1+1')
                st.append(c)
            elif st[-1] == ')':
                st.append(c)
            else:
                assert False

    t = ''.join(st)
    cnt = t.count('1')
    if cnt <= K:
        ans = t + ('+1' * (K - cnt))
        if ans.endswith(')'):
            print('No')
        else:
            print('Yes')
            print(ans)
    else:
        print('No')


solve(K, S)