#include <bits/stdc++.h>
using namespace std;
int N;
long long K;
inline long long sum(long long n) { return (1 + n) * n / 2; }
int main() {
  cin >> N >> K;
  for (int i = 1; i <= N; ++i) {
    long long x = sum(i - 1);
    if (i == N) {
      if (x < K) {
        puts("Impossible");
        return 0;
      } else {
        for (int j = 1; j <= N; ++j) putchar('(');
        for (int j = 1; j <= N; ++j) putchar(')');
        putchar('\n');
        return 0;
      }
    }
    if (sum(i) > K) {
      long long p = K - x;
      for (int j = 1; j <= p; ++j) putchar('(');
      putchar('('), putchar(')');
      for (int j = p + 1; j <= i; ++j) putchar('(');
      for (int j = 1; j <= i; ++j) putchar(')');
      for (int j = i + 1; j < N; ++j) {
        putchar('(');
        putchar(')');
      }
      return 0;
    }
  }
  return 0;
}
