#include <bits/stdc++.h>
//#include "atcoder/fenwicktree"
using namespace std;
typedef long long ll;
const int INF = 1<<30;
const ll INFLL = 1LL<<60;
const ll MOD = 998244353;
const double INFD = 1.0E18;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, -1, 0, 1};
//const int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//const int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using Pair = pair<ll, ll>;
using Graph = vector<vector<pair<int, int>>>;



int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    int n, k; cin >> n >> k;
    string s; cin >> s;
    //最低の値、n/2葉
    bool ok = true;
    int cnt = 0;
    int m = n / 2;
    bool be = true;
    for (int i = 0; i < n; i++){
        if (s[i] == '(') cnt++;
        else cnt--;
        if (cnt < 0) ok = false;
        if (i != n - 1 && cnt == 0) be = false;
        if (i > 0 && s[i - 1] == '(' && s[i] == ')') m++;
    }
    if (cnt != 0) ok = false;
    if (k < m || (k == m && be)) ok = false;
    cout << (ok ? "Yes" : "No") << endl;
    if (ok){
        bool begin = true;
        string ans;
        for (int i = 0; i < n; i++){
            if (s[i] == '(') ans += "(";
            else{
                if (i > 0 && s[i - 1] == '('){
                    ans += "1+1";
                }
                else{
                    ans += "1";
                }
                ans += ")";
                if (i != n - 1) ans += "+";
            }
        }
        for (int j = 0; j < k - m; j++) ans += "+1";
        cout << ans << endl;
    }
    
    return 0;
}