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 <algorithm>
#include <vector>
#include <string>
#define int long long
using namespace std;
signed main() {
	int a, b, p; string s;
	cin >> a >> b;
	p = a & b;
	for (int i = 0; i < 32; i++) {
		s = (p % 2 ? '1' : '0') + s;
		p /= 2;
	}
	cout << s << endl; s.clear();
	p = a | b;
	for (int i = 0; i < 32; i++) {
		s = (p % 2 ? '1' : '0') + s;
		p /= 2;
	}
	cout << s << endl; s.clear();
	p = a ^ b;
	for (int i = 0; i < 32; i++) {
		s = (p % 2 ? '1' : '0') + s;
		p /= 2;
	}
	cout << s << endl;
}