#include<bits/stdc++.h>
using namespace std;
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define REP(i, l, r) rep(i, l, r+1)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
struct Edge {
  int to; ll w;
};
using Graph = vector<vector<int> >;
//using Graph = vector<vector<Edge> >;
const ll INF = 2e18;
//const int INF = 2e9;
template<class T> using vc = vector<T>;
template<class T> using vv = vector<vector<T> >;
template<class T> using vvv = vector<vector<vector<T> > >;
template<class T> using pq = priority_queue<T>;
template<class T> using pq_g = priority_queue<T, vc<T>, greater<T> >;
template<class T> istream& operator>>(istream& i, vc<T>& v) { rep(j, 0, v.size()) i>>v[j]; return i; }
template<class T> ostream& operator<<(ostream& o, vc<T>& v) { rep(j, 0, v.size()) o<<v[j]<<" "; return o; }
template<class T> bool chmin(T& a, T b) {
  if(a > b) {
      a = b;
      return true;
  }
  return false;
}
template<class T> bool chmax(T& a, T b) {
  if(a < b) {
      a = b;
      return true;
  }
  return false;
}

int N, K;
string ans = "";
void rec(string& S, int& p) {
  if(S[p+1] == ')') {
    ans += "(1+1)";
    p+=2;
    K-=2;
    return;
  }
  p++;
  ans += "(1+";
  rec(S, p);
  K--;
  p++;
  ans += ")";
}

int main() {
  // 高速化
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  // 小数点の出力桁数を指定
  cout << fixed << setprecision(10);
  // メイン
  cin >> N >> K;
  string S;
  cin >> S;

  int cnt = 0;
  bool ok = true;
  rep(i, 0, N) {
    if(S[i] == '(') cnt++;
    else cnt--;
    if(cnt <0 ) ok = false;
  }
  if(cnt > 0) ok = false;
  if(!ok) {
    cout << "No" << endl;
    return 0;
  }

  cnt = N/2;
  rep(i, 0, N-1) {
    if(S[i] == '(' && S[i+1] == ')') cnt++;
  }

  int p = 0;
  bool b = true;
  while(p != S.size()) {
    if(b) b = false;
    else ans += "+";
    rec(S, p);
  }
  if(K < 0) {
    cout << "No" << endl;
    return 0;
  }
  rep(i, 0, K) ans += "+1";
  cout << "Yes" << endl;
  cout << ans << endl;

  return 0;
}