Two's Complement

Medium#engineering #digital #bit-manipulation· solved by 0 · time limit 2.0 s

Print the $b$ -bit two's complement representation of the integer $n$ (exactly $b$ binary digits). If $n$ doesn't fit in $b$ signed bits (range $-2^{b-1} \dots 2^{b-1}-1$ ), print Overflow.

Input

Two integers $n$ and $b$ .

Output

The bit pattern or Overflow.

Constraints

$1 \le b \le 64$ , $|n| \le 2^{63}$

Sample 1

Input

5 8

Output

00000101

Sample 2

Input

-5 8

Output

11111011