#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
int n, cnt[N];
long long k;
void dfs(int v) {
  cnt[v]--;
  cout << "(";
  while (cnt[v + 1]) {
    dfs(v + 1);
  }
  cout << ")";
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  ;
  cin >> n >> k;
  for (long long i = 0; i <= k; ++i) {
    k -= i;
    cnt[i]++;
    n--;
    if (n < 0) {
      return !printf("Impossible\n");
    }
  }
  if (k) cnt[k]++, n--;
  if (n < 0) return !printf("Impossible\n");
  while (n) cnt[0]++, n--;
  while (cnt[0]) dfs(0);
  cout << "\n";
  return 0;
}
