#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<i64(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
using namespace std;

void testcase(){
    i64 N, K; cin >> N >> K;
    string S; cin >> S;
    i64 dep = 0;
    string res;
    vector<i64> T = {0};
    for(char c : S){
        dep += (c == '(' ? 1 : -1);
        if(dep < 0){ cout << "No\n"; return; }
        if(c == ')'){
            if(res.back() == ')'){
                if(T.back() == 0){
                    res += "+1"; K -= 1;
                }
            } else {
                res += "1+1"; K -= 2;
            }
            T.pop_back();
        } else {
            if(!res.empty()){
                if(res.back() == ')'){
                    res += "+";
                    T.back() += 1;
                }
            }
            T.push_back(0);
        }
        res.push_back(c);
    }
    if(dep != 0){ cout << "No\n"; return; }
    if(T.back() == 0){
        K--;
        res += "+1";
    }
    if(K < 0){ cout << "No\n"; return; }
    while(K--) res += "+1";
    cout << "Yes\n" << res << "\n";
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    testcase();
    return 0;
}