Complementary code - 1#5320

Complementary code - 1

1 second

128 megabytes

Very easy

Write a program that, given two numbers $a$ and $n$ , outputs the representation of the number $a$ in $n$ -bit binary two's complement code.

\InputFileA single line contains two numbers $a$ and $n$ ( $2 \leq n \leq 16$ 2 \leq n \leq 16, $- 2^{n - 1} \leq a \leq 2^{n - 1} - 1$ -2^{n-1} \leq a \leq 2^{n-1} - 1).

\OutputFilePrint a string of $n$ digits representing the number $a$ in $n$ -bit binary two's complement code, where the first digit is the most significant (sign) bit.

Examples

Example 1

Loading

Example 2

Loading

2 \leq n \leq 16

- 2^{n - 1} \leq a \leq 2^{n - 1} - 1