#include using namespace std; #define ALL(x) (x).begin(),(x).end() #define IO ios::sync_with_stdio(false),cin.tie(nullptr); #define REP(i, n) for(ll i=0; i<(ll)(n); i++) #define FOR(i, a, b) for(ll i=(ll)(a); (a)<(b) ? i<(b) : i>(b); i+=((a)<(b) ? 1 : -1)) template int LB(const vector& v, T x) { return lower_bound(ALL(v),x)-(v).begin(); } template int UQ(T& v) { sort(ALL(v)); v.erase(unique(ALL(v)),v.end()); return v.size(); } template bool chmax(T &a, T b) { return a bool chmin(T &a, T b) { return a>b ? a=b, true : false; } template using rpriority_queue=priority_queue,greater>; using ll=long long; const int INF=1e9+10; const ll INFL=4e18; using ld=long double; using ull=unsigned long long; using lll=__int128_t; using VI=vector; using VVI=vector; using VL=vector; using VVL=vector; using PL=pair; using VP=vector; using WG=vector>>; #ifdef LOCAL #include "./debug.hpp" #else #define debug(...) #define print_line #endif //---------------------------------------------------------- int valid(string s) { int a=0; int cnt=0; REP(i,s.size()) { if(s[i]=='(') a++; else a--; if(a<0) return false; if(a==0) cnt++; } if(a!=0) return 0; return cnt; } int main() { int N,K; cin>>N>>K; string S; cin>>S; int v=valid(S); if(!v) { puts("No"); return 0; } int tmp=0; REP(i,N) { if(S[i]=='(') tmp++; if(S[i]==')'&&S[i-1]=='(') tmp++; } if(tmp>K) { puts("No"); return 0; } string ans; REP(i,N) { if(S[i]=='('&&i>0&&S[i-1]==')') ans+="+(1+"; else if(S[i]=='(') ans+="(1+"; if(S[i]==')'&&S[i-1]==')') ans+=")"; else if(S[i]==')') ans+="1)"; } debug(ans); if(v==1&&ans.front()=='('&&ans.back()==')') { if(tmp==K) { puts("No"); return 0; } tmp++; ans="1+"+ans; } while(tmp