#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  int n, k; string s;
  cin >> n >> k >> s;
  int x = 0;
  int p = 0;
  rep(i,0,n) {
    if (s[i] == '(') ++x;
    else --x;
    if (x < 0) {
      cout << "No" << endl;
      return 0;
    }
    if (x == 0) ++p;
  }
  if (x != 0) {
    cout << "No" << endl;
    return 0;
  }
  string t = "";
  rep(i,0,n) {
    if (s[i] == '(') t += "(1+";
    else t += ")";
  }
  // cout << t << endl;
  n = len(t);
  string u = "";
  rep(i,0,n) {
    u += t[i];
    if (i < n-1 && t[i] == ')' && t[i+1] == '(') {
      u += "+";
    }
    if (i < n-1 && t[i] == '+' && t[i+1] == ')') {
      u += "1";
    }
  }
  if (p == 1) u += "+1";
  // cout << u << endl;
  n = len(u);
  int cnt = 0;
  rep(i,0,n) cnt += (u[i] == '1');
  if (cnt > k) {
    cout << "No" << endl;
    return 0;
  }
  rep(i,0,k-cnt) u += "+1";
  cout << "Yes" << endl;
  cout << u << endl;
  return 0;
}