#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; #define fi first #define se second #define vi vector<int> #define vll vector<long long> #define pii pair<int, int> #define pll pair<long long, long long> #define pb push_back #define mp make_pair #define eb emplace_back #define all(x) (x).begin(), (x).end() #define sz(x) (int)(x).size() mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count()); inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);} inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);} #ifdef DEBUG auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";} auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";} #define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X) #else #define debug(...){} #endif struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; struct pair_hash{ size_t operator()(const pair<int,int>&x)const{ return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32)); } }; int ask(int x, int y){ cout << "? " << x + 1 << ' ' << y + 1 << endl; cout.flush(); int res; cin >> res; return res; } int main(){ // ios_base::sync_with_stdio(0); // cin.tie(NULL); // cout.tie(NULL); int n, Q; cin >> n >> Q; vi a(n, -1); int i = 0; int cnt[2] = {0, 0}; while(i + 1 < n){ if(ask(i, i + 1)){ cnt[0]++; cnt[1]++; a[i] = 0; a[i + 1] = 1; int j = 1; int wskL = i - 1; while(wskL >= 0 && i + 1 + j < n){ while(wskL >= 0 && a[wskL] != -1){ wskL--; } if(wskL < 0){ break; } if(ask(wskL, i + j + 1)){ a[wskL] = 0; a[i + j + 1] = 1; cnt[0]++; cnt[1]++; j++; wskL--; }else{ break; } } i = i + 1 + j; }else{ i++; } } for(i = 0; i < n; i++){ if(a[i] == -1){ if(cnt[1] < n / 2){ cnt[1]++; a[i] = 1; }else{ a[i] = 0; } } } string ans = ""; for(i = 0; i < n; i++){ if(a[i] == 0){ ans += "("; }else{ ans += ")"; } } cout << "! " << ans << endl; cout.flush(); return 0; }