#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define maxn 3005
#define put() putchar('\n')
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
using namespace std;
void read(int &x){
    int f=1;x=0;char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
    while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
    x*=f;
}
namespace Debug{
	Tp void _debug(char* f,Ty t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,Ty x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	Tp ostream& operator<<(ostream& os,vector<Ty>& V){os<<"[";for(auto& vv:V) os<<vv<<",";os<<"]";return os;}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
int power(int x,int y=mod-2) {
	int sum=1;
	while (y) {
		if (y&1) sum=sum*x%mod;
		x=x*x%mod;y>>=1;
	}
	return sum;
}
int n,m;
int h[maxn],head=1;
struct yyy {
	int to,z,w;
	void add(int x,int y,int val) {
		to=y;z=h[x];h[x]=head;w=val;
	}
}a[maxn*2];
int t[maxn][maxn];
int cnt[maxn],dis[maxn];
queue<int>q;
void spfa(int x) {
	int i;
	memset(dis,0x3f,sizeof(dis));
	q.push(x);dis[x]=0;
	while (!q.empty()) {
		x=q.front();q.pop();
		for (i=h[x];i;i=a[i].z) if (dis[a[i].to]>dis[x]+a[i].w) {
			dis[a[i].to]=dis[x]+a[i].w;
			q.push(a[i].to);++cnt[a[i].to];
			if (cnt[a[i].to]>n) {puts("?");exit(0);}
		}
	}
}
int ans[maxn];
signed main(void){
	int i,j,l,r,x,y;
	memset(t,-1,sizeof(t));
	read(n);read(m);
	for (i=1;i<=m;i++) {
		read(l),read(r);read(x);
		int tmp=r-l+1+x;
		if (tmp%2) return puts("?"),0;
		else {
			if (t[l][r]>=0&&t[l][r]!=tmp/2)  return puts("?"),0;
			t[l][r]=tmp/2;
		}
	} 
	for (i=1;i<=n;i++) {
		int id=n;
		for (j=i;j<=n;j++) if (t[i][j]>=0) {
			a[++head].add(i-1,j,t[i][j]);
			a[++head].add(j,i-1,-t[i][j]);
			id=j;break;
		}
		for (j=id+1;j<=n;j++) if (t[i][j]>=0) {
			if (t[id+1][j]>=0&&t[id+1][j]!=t[i][j]-t[i][id]) return puts("?"),0;
			t[id+1][j]=t[i][j]-t[i][id];
 		}
	}
	for (i=0;i<n;i++) a[++head].add(i,i+1,1),a[++head].add(i+1,i,0);
	for (i=1;i<=n;i++) a[++head].add(i,0,-(i+1)/2);
	a[++head].add(0,n,n/2);
	spfa(0);
	if (dis[n]!=n/2) return puts("?"),0;
//	for (i=0;i<=n;i++) gdb(i,dis[i]);
	printf("! ");
	int tot=0;
	for (i=1;i<=n;i++) {
		if (dis[i]-dis[i-1]==0) ans[i]=2,tot--;
		else ans[i]=1;
	}
	for (i=1;i<=n;i++) putchar(ans[i]==1?'(':')');
	return 0;
}