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:
// file name: 逻辑操作2: 两个数按位与,或,非
// Written by: by_sknight
// Date: 2019/6/13

#include <bits/stdc++.h>
using namespace std;

int main(void) {
	ios::sync_with_stdio(false);
	cin.tie(0);

	unsigned int a, b; cin >> a >> b;
	bitset<32> bs_a(a), bs_b(b), bs;
	bs = bs_a & bs_b;
	cout << bs << endl;
	bs = bs_a | bs_b;
	cout << bs << endl;
	bs = bs_a ^ bs_b;
	cout << bs << endl;
}