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 <fstream>
#include <algorithm>
#include <bits/stdc++.h>
//#define LOCAL
using namespace std;
typedef long long ll;


int main() {
#ifdef LOCAL
ifstream fin("1.txt");
streambuf*p;
p=cin.rdbuf(fin.rdbuf());
#endif // LOCAL
ll num1,num2;
cin>>num1>>num2;
bitset<32>a(num1), b(num2);
cout<< (a&b) <<endl;
cout<< (a|b) <<endl;
cout<< (a^b) <<endl;


#ifdef LOCAL
fin.close();
#endif // LOCAL
}