#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int n,k;
char s[200005];
int main() {scanf("%d%d", &n, &k);scanf("%s", s + 1);k/=2;int cnt = 0,cnt2=0;for(int i=1;i<=n;i++){if(s[i]=='(')cnt++;elsecnt2++;printf("%c",s[i]);if(cnt==k)break;}cnt2 = cnt-cnt2;while (cnt2--){printf(")");}
}

#include <bits/stdc++.h>typedef long long ll;
using namespace std;
const int N = 2e5 + 5;
int n, q;
int a[N], vis[N],l[N],r[N],flag[N];
int minn[4*N];void build(int k, int l, int r) {if (l == r) {minn[k] = a[l];return;}int mid = (l + r) >> 1;build(k << 1, l, mid);build(k << 1 | 1, mid + 1, r);minn[k] = min(minn[k*2],minn[k*2+1]);
}void update(int k, int l, int r) {}int query(int k, int lef, int rig, int l, int r) {if (l <= lef && r >= rig)return minn[k];int mid = (lef + rig) / 2;int ans = 1e9;if (l <= mid)ans = min(ans, query(k * 2, lef, mid, l, r));if (r > mid)ans = min(ans, query(k << 1 | 1, mid + 1, rig, l, r));return ans;
}int main() {scanf("%d%d", &n, &q);for (int i = 1; i <= n; i++)scanf("%d", &a[i]);for (int i = 1; i <= n; i++) {int j = i + 1;while (j <= n && (a[j] == a[i] || a[j] == 0)) {if (a[j] == 0) {a[j] = a[i];flag[j]=1;}j++;}vis[a[i]] = 1;i = j - 1;}int temp = 0;if(a[1]!=0&&!vis[q]){for(int i=1;i<=n;i++){if(flag[i]){a[i]=q;vis[q]=1;break;}}if(!vis[q]) {printf("NO\n");return 0;}}if (a[1] == 0) {if (!vis[q]) {temp = q;} else {for (int i = 1; i <= n; i++) {if (a[i] != 0) {temp = a[i];break;}}}for (int i = 1; i <= n; i++) {if (a[i] == 0)a[i] = temp;}}for(int i=1;i<=n;i++){if(l[a[i]]==0)l[a[i]]=i;r[a[i]]=i;}build(1,1,n);for(int i=1;i<=q;i++){if(l[i]==0)continue;if(query(1,1,n,l[i],r[i])<i){printf("NO\n");return 0;}}printf("YES\n");for(int i=1;i<=n;i++){printf("%d ",a[i]);}
}

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>using namespace std;
int n;bool ask(int n,int m,int x,int y){cout<<"? "<<n<<" "<<m<<" "<<x<<" "<<y<<endl;string s;cin>>s;return s[0]=='Y';
}
int main(){string ans1="";string ans2="";scanf("%d",&n);int i=1,j=1;int cnt =0;while (i<=n&&j<=n&&++cnt<=(n-1)){if(ask(i,j+1,n,n)){j++;ans1+="R";} else{i++;ans1+="D";}}i=n;j=n;cnt=0;while (i>=1&&j>=1&&++cnt<=n-1){if(ask(1,1,i-1,j)){i--;ans2+="D";} else{j--;ans2+="R";}}reverse(ans2.begin(),ans2.end());printf("! ");cout<<ans1<<ans2;
}