#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
long long POW(long long a, long long b, long long MMM = MOD) {
  long long ret = 1;
  for (; b; b >>= 1, a = (a * a) % MMM)
    if (b & 1) ret = (ret * a) % MMM;
  return ret;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) {
  if (a == 0 || b == 0) return a + b;
  return a * (b / gcd(a, b));
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int ddx[] = {0, 0, 1, 1, 1, -1, -1, -1}, ddy[] = {1, -1, 1, 0, -1, 1, 0, -1};
int main() {
  long long n, k;
  scanf("%lld%lld", &n, &k);
  if (k > n * (n - 1) / 2) return !printf("Impossible");
  int cnt = 0, now = 0;
  long long sum = 0;
  for (; sum + now <= k; now++) {
    putchar('(');
    cnt++;
    sum += now;
  }
  long long t = k - sum;
  while (t != now) {
    putchar(')');
    now--;
  }
  if (cnt == n) return 0;
  putchar('(');
  cnt++;
  while (now >= 0) {
    putchar(')');
    now--;
  }
  while (cnt < n) {
    printf("()");
    cnt++;
  }
}
