#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int n, k;
  cin >> n >> k;
  string s;
  cin >> s;
  string ans;
  {
    int cnt = 0, mi = 0;
    for (auto c : s)
    {
      cnt += (c == '(' ? 1 : -1);
      mi = min(mi, cnt);
    }
    if (mi < 0 || cnt != 0)
    {
      cout << "No" << endl;
      return 0;
    }
  }
  int pos = 0;
  auto dfs = [&](auto f) -> int
  {
    int cnt = 0;
    if (pos < n && s[pos++] == '(')
    {
      ++cnt;
      ans.push_back('(');
      int tmp = f(f);
      if (tmp == 0) ans += "1+1";
      else if (tmp == 1) ans += "+1";
      ans.push_back(')');
    }
    else return 0;
    while (pos < n && s[pos++] == '(')
    {
      ++cnt;
      ans.push_back('+');
      ans.push_back('(');
      int tmp = f(f);
      if (tmp == 0) ans += "1+1";
      else if (tmp == 1) ans += "+1";
      ans.push_back(')');
    }
    return cnt;
  };
  int tmp = dfs(dfs);
  int sum = 0;
  for (auto c : ans) sum += (c == '1');
  if (pos < n || sum > k || (tmp == 1 && sum >= k))
  {
    cout << "No" << endl;
  }
  else
  {
    while (sum++ < k) ans += "+1";
    cout << "Yes" << endl;
    cout << ans << endl;
  }
}