#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFF = 0x3f3f3f3f3f3f3f3fll;
const long long M = 1e9 + 7;
const long long maxn = 2e5 + 7;
const double eps = 0.00000001;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
template <typename T>
inline T abs(T a) {
  return a > 0 ? a : -a;
}
template <typename T>
inline T powMM(T a, T b) {
  T ret = 1;
  for (; b; b >>= 1ll, a = a * a % M)
    if (b & 1) ret = 1ll * ret * a % M;
  return ret;
}
long long n, k, now;
int i;
int main() {
  scanf("%d%I64d", &n, &k);
  if (n * (n - 1) / 2 < k) return 0 * puts("Impossible");
  for (i = 0; i < n; i++) {
    while (k < now) putchar(')'), now--;
    k -= now;
    putchar('('), now++;
  }
  for (i = 0; i < now; i++) putchar(')');
}
