#include <bits/stdc++.h>
#include <iostream>
using namespace std;

int main(){
    int N,K;
    string S;
    cin >> N >> K;
    cin >> S;

    vector<char> stack;
    for (int i=0; i<N; i++){
        if (stack.size()>0 && stack.back()=='(' && S[i]==')'){
            stack.pop_back();
        } else {
            stack.push_back(S[i]);
        }
    }

    if (!stack.empty()){
        cout << "No" << endl;
    } else {
        int cnt=0;
        for (int i=0; i<N-1; i++){
            if (S[i]=='(' && S[i+1]==')'){
                cnt++;
            }
        }
        if (cnt*2+(N/2-cnt)<=K){
            vector<char> ans;
            for (int i=0; i<N-1; i++){
                if (S[i]=='(' && S[i+1]==')'){
                    ans.push_back('(');
                    ans.push_back('1');
                    ans.push_back('+');
                    ans.push_back('1');
                    K -= 2;
                } else if (S[i]==')' && S[i+1]=='('){
                    ans.push_back(S[i]);
                    ans.push_back('+');
                } else if (S[i]=='('){
                    ans.push_back(S[i]);
                } else {
                    ans.push_back(S[i]);
                    ans.push_back('+');
                    ans.push_back('1');
                    K -= 1;
                }
            }
            ans.push_back(S.back());
            for (int i=0; i<K; i++){
                ans.push_back('+');
                ans.push_back('1');
            }
            cout << "Yes" << endl;
            for (int i = 0; i < (int)ans.size(); i++) {
                cout << ans[i];
            }
            cout << endl;
        } else {
            cout << "No" << endl;
        }
    }
    return 0;
}