#include <bits/stdc++.h>
using namespace std;
int cnt[300010];
void f(int x, int y);
int main() {
  long long n, k, base = 0;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    base += i - 1;
    if (base <= k && base + (n - i) * (i - 1) >= k) {
      n -= i;
      k -= base;
      for (int j = i; j >= 0; j--) {
        while (n && k - (j - 1) >= 0) {
          cnt[j]++;
          k -= j - 1;
          n--;
        }
      }
      f(1, i + 1);
      while (cnt[0]--) printf("()");
      printf("\n");
      return 0;
    }
  }
  printf("Impossible\n");
  return 0;
}
void f(int x, int y) {
  if (x == y) return;
  printf("(");
  f(x + 1, y);
  printf(")");
  while (cnt[x]--) printf("()");
}
