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<bits/stdc++.h>
#include <array>
using namespace std;

#define rep(i, n) for(int i = 0; i < (n); i++)
using LL = long long;
using ULL = unsigned long long;

void coutbits(unsigned n) {
	for (int i = 31; i >= 0; i--) {
		cout << (((n >> i) & 1) ? 1 : 0);
	}
}

void solve() {
	unsigned a, b; cin >> a >> b;
	coutbits(a & b); cout << endl;
	coutbits(a | b); cout << endl;
	coutbits(a ^ b); cout << endl;
}

int main() {

	solve();

	return 0;
}