#include <bits/stdc++.h>
using namespace std;
long long binsearch(long long n, long long k) {
  long long l = 0, r = n + 1;
  while (r - l > 1) {
    long long m = (l + r) / 2;
    if (m * (m - 1) / 2 <= k) {
      l = m;
    } else {
      r = m;
    }
  }
  return l;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, k;
  cin >> n >> k;
  if (n * (n - 1) / 2 < k) {
    cout << "Impossible" << endl;
  } else {
    long long m = binsearch(n, k);
    long long to_add = k - m * (m - 1) / 2;
    if (to_add == 0) {
      cout << string(m, '(') + string(m, ')');
      for (long long i = 0; i < n - m; i++) {
        cout << "()";
      }
    } else {
      for (long long z = 0; z < m; ++z) {
        cout << '(';
        if (to_add - 1 == z) {
          cout << "()";
        }
      }
      cout << string(m, ')');
      for (long long i = 0; i < n - m - 1; i++) {
        cout << "()";
      }
    }
  }
  return 0;
}
