#include <bits/stdc++.h>
#define For(i, a, b) for(i32 i = (a), endi = (b); i <= endi; ++i)
#define foR(i, a, b) for(i32 i = (a), endi = (b); i >= endi; --i)
using namespace std;

template<typename T, typename U>
void chkmin(T &a, U b) { if(a > b) a = b; }

using i32 = int;
using i64 = long long;
using f64 = long double;
using pii = pair<i32, i32>;

void init() { }

void solve()
{
    i32 n, m;
    cin >> n >> m;
    vector<vector<pii>> pos(n+1);
    For(i, 1, m)
    {
        i32 l, r, c;
        cin >> l >> r >> c;
        pos[r].emplace_back(l-1, c);
    }
    vector dp(n+1, vector(n+1, false));
    dp[0][0] = true;
    For(x, 1, n) For(y, 0, n / 2)
    {
        if(y) dp[x][y] = dp[x][y] | dp[x-1][y-1];
        dp[x][y] = dp[x][y] | dp[x-1][y+1];
        for(auto [l, del]: pos[x])
        {
            if(y - del < 0 || y - del > n) dp[x][y] = false;
            dp[x][y] = dp[x][y] & dp[l][y - del];
        }
    }
    if(!dp[n][0])
    {
        cout << "?\n";
        return;
    }
    cout << "! ";
    i32 x = n, y = 0;
    string res;
    while(x)
    {
        --x;
        if(y && dp[x][y-1]) res.push_back('('), --y; 
        else res.push_back(')'), ++y;
    }
    reverse(res.begin(), res.end());
    cout << res << '\n';
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    init();
    i32 T = 1;
    // cin >> T;
    while(T--) solve();
    return 0;
}