Problem: Given two non-negative decimal integers $a$ and $b$, calculate their AND (logical conjunction), OR (logical disjunction) and XOR (exclusive disjunction) and print them in binary representation of 32 bits.

Constraints

* $0 \leq a, b \leq 2^{32} - 1$

Input

The input is given in the following format.


$a \; b$


Output

Print results of AND, OR and XOR in a line respectively.

Example

Input

8 10


Output

00000000000000000000000000001000
00000000000000000000000000001010
00000000000000000000000000000010

Solution (in CPP):

Solution:
#include <iostream>
#include <bitset>
using namespace std;

int main() {
	unsigned int a, b;
	cin >> a >> b;

	cout << bitset<32>(a&b) << endl;
	cout << bitset<32>(a|b) << endl;
	cout << bitset<32>(a^b) << endl;

	return 0;
}