#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
bool chk(string s) {
	int n = s.size();
	int c = 0;
	rep(i, n) {
		if (s[i] == '(')c++;
		else c--;
		if (c < 0) return false;
	}
	return c == 0;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k;
	string s;
	cin >> n >> k >> s;
	if (!chk(s)) {
		cout << "No" << endl;
		return 0;
	}
	string t;
	rep(i, n) {
		if (s[i] == '(') {
			if (t.empty())t += s[i];
			else if (t.back() == ')')t += "+(";
			else t += "1+(", k--;
		}
		else {
			if (t.back() == '(') {
				t += "1+1)";
				k -= 2;
			}
			else {
				t += s[i];
			}
		}
	}
	if (k < 0) {
		cout << "No" << endl;
		return 0;
	}
	while (k--)t += "+1";
	int x = 0;
	bool ok = false;
	for (auto c : t) {
		if (c == '(') {
			x++;
		}
		else if (c == ')') {
			x--;
		}
		if (x == 0 && c == '+') {
			ok = true;
		}
	}
	if (ok) {
		cout << "Yes" << endl;
		cout << t << endl;
	}
	else {
		cout << "No" << endl;
	}
}