#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n, k;
  string s;
  cin >> n >> k >> s;
  bool ok = true;
  ll z = 0;
  {
    ll c = 0;
    rep(i, n) {
      if (s[i] == '(') {
        c++;
      } else {
        c--;
      }
      ok &= c >= 0;
      if (c == 0) {
        z++;
      }
    }
    ok &= c == 0;
    if (!ok) {
      cout << "No\n";
      return;
    }
  }
  string ans = "";
  rep(i, n) {
    if (s[i] == '(') {
      if (!ans.empty() && ans.back() == ')') {
        ans.push_back('+');
      }
      ans += "(1+";
      k--;
    } else {
      if (!ans.empty() && ans.back() == '+') {
        ans.push_back('1');
        k--;
      }
      ans.push_back(')');
    }
  }
  ok &= k >= 0;
  if (k == 0) {
    ok &= z >= 2;
  }
  if (!ok) {
    cout << "No\n";
    return;
  }
  rep(ki, k) ans += "+1";
  cout << "Yes\n" << ans << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}