Problem: Recall that the bracket sequence is considered regular if it is possible to insert symbols '+' and '1' into it so that the result is a correct arithmetic expression. For example, a sequence "(()())" is regular, because we can get correct arithmetic expression insering symbols '+' and '1': "((1+1)+(1+1))". Also the following sequences are regular: "()()()", "(())" and "()". The following sequences are not regular bracket sequences: ")(", "(()" and "())(()".

In this problem you are given two integers n and k. Your task is to construct a regular bracket sequence consisting of round brackets with length 2·n with total sum of nesting of all opening brackets equals to exactly k. The nesting of a single opening bracket equals to the number of pairs of brackets in which current opening bracket is embedded.

For example, in the sequence "()(())" the nesting of first opening bracket equals to 0, the nesting of the second opening bracket equals to 0 and the nesting of the third opening bracket equal to 1. So the total sum of nestings equals to 1.

Input

The first line contains two integers n and k (1 ≤ n ≤ 3·105, 0 ≤ k ≤ 1018) — the number of opening brackets and needed total nesting.

Output

Print the required regular bracket sequence consisting of round brackets.

If there is no solution print "Impossible" (without quotes).

Examples

Input

3 1


Output

()(())

Input

4 6


Output

(((())))

Input

2 5


Output

Impossible

Note

The first example is examined in the statement.

In the second example the answer is "(((())))". The nesting of the first opening bracket is 0, the nesting of the second is 1, the nesting of the third is 2, the nesting of fourth is 3. So the total sum of nestings equals to 0 + 1 + 2 + 3 = 6.

In the third it is impossible to construct a regular bracket sequence, because the maximum possible total sum of nestings for two opening brackets equals to 1. This total sum of nestings is obtained for the sequence "(())".

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
long long F(long long n) { return (n * (n - 1)) >> 1; }
long long solve(long long n, long long k) {
  long long low, high, mid;
  low = 1, high = n;
  while ((low + 1) < high) {
    mid = (low + high) >> 1;
    if (F(mid) <= k)
      low = mid;
    else
      high = mid;
  }
  if (F(high) <= k) return high;
  if (F(low) <= k) return low;
  return -1;
}
void print(long long n, long long x, long long c) {
  long long i;
  for (i = 0; i < x; i++) putchar('(');
  for (i = 0; i < (x - c); i++) putchar(')');
  if (c) printf("()");
  for (i = 0; i < c; i++) putchar(')');
  n -= x;
  if (c) n--;
  for (i = 0; i < n; i++) printf("()");
  puts("");
}
int main() {
  long long n, k;
  while (scanf("%lld %lld", &n, &k) != EOF) {
    if (F(n) >= k) {
      long long x = solve(n, k);
      if (F(x) != k && x == n)
        puts("Impossible");
      else
        print(n, x, k - F(x));
    } else
      puts("Impossible");
  }
  return 0;
}