import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

def ng():
    print("No")
    exit()

n, k = LI()
s = SI()

t = 0
for c in s:
    if c == "(":
        t += 1
    else:
        t -= 1
    if t < 0: ng()
if t: ng()

st = []
ans = "+"
pre = -10
for i, c in enumerate(s):
    if c == "(":
        if ans[-1] == ")" or ans[-1] == "1": ans += "+"
        ans += "("
        st.append(i)
    else:
        j = st.pop()
        if j+1 == i:
            ans += "1+1"
            k -= 2
        elif j+1 == pre:
            ans += "+1"
            k -= 1
        ans += ")"
        pre = j
if k < 0: ng()
ans += "+1"*k
print("Yes")
print(ans[1:])