#include <bits/stdc++.h>
using namespace std;
const int maxx = 600010;
const double pi = acos(-1.0);
const double eps = 1e-15;
long long t, n, m, k, u, v;
long long ans = 0, total = 0, sum = 0, cnt = 0, l = 0, r = 0;
long long a[maxx];
int main() {
  scanf("%lld%lld", &n, &k);
  sum = ((n - 1) * (n - 1) + n - 1) / 2;
  if (k > sum)
    printf("Impossible");
  else {
    total = sum - k;
    l = 1, r = n;
    while (total) {
      if (r - l < total)
        cnt++, total -= r - l, r--, l = 1;
      else {
        r--;
        ans = total;
        total = 0;
      }
    }
  }
  for (int i = 1; i <= r; i++) printf("(");
  for (int i = 1; i <= r; i++) {
    if (ans == i)
      printf(")()");
    else
      printf(")");
  }
  for (int i = 1; i <= cnt; i++) printf("()");
  return 0;
}
