eolymp
bolt
Try our new interface for solving problems
Problems

Complementary code - 1

Complementary code - 1

Time limit 1 second
Memory limit 128 MiB

Given numbers a and n, print the representation of a in n-bit binary complement code.

Print a line with n digits containing the representation of number a in n-bit binary complement code, where the first digit is the highest bit.

Input data

In one line given two numbers a and n (2n16, -2^(n-1)a2^(n-1)-1).

Output data

Print the number in n-bit complement code.

Examples

Input example #1
5 8
Output example #1
00000101
Input example #2
-5 8
Output example #2
11111011