Given a pair of integers, convert each integer into its binary representation and return the corresponding binary values.

For each number, represent it in binary without leading zeroes.

Input

Two integers a and b.

Output

Return the binary representation of both numbers.

Example 1

Input:
a = 10
b = 7

Binary representations:

10 → 1010
7  → 111

Output:
1010 111

Example 2

Input:
a = 5
b = 12

5  → 101
12 → 1100

Output:
101 1100

Constraints

1 ≤ a, b ≤ 10^9