#include <bits/stdc++.h>
using namespace std;
int n;
long long k;
int v[500005];
int main() {
  cin >> n >> k;
  int x = n;
  while (1LL * x * (x - 1) / 2 > k) --x;
  k -= 1LL * x * (x - 1) / 2;
  n -= x;
  int p = x - 1;
  while (n && k) {
    n--;
    while (p > 0 && k < p) p--;
    k -= p;
    v[p]++;
  }
  if (k != 0) {
    cout << "Impossible";
    return 0;
  }
  v[0] += n;
  for (int i = 0; i < x; ++i) {
    for (int j = 1; j <= v[i]; ++j) cout << "()";
    cout << "(";
  }
  for (int i = 0; i < x; ++i) cout << ")";
  return 0;
}
