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>
using namespace std;

long long x, k;
bool y[32], m[32], a[32];

int main() {
    cin >> x >> k;
    for (int i=0; i<32; i++) {
        y[31-i] = x%2;
        x/=2;
    }
    for (int i=0; i<32; i++) {
        m[31-i] = k%2;
        k/=2;
    }
    for (int i=0; i<32; i++) a[i] = y[i] & m[i];
    for (int i=0; i<32; i++) cout << a[i];
    cout << endl;
    for (int i=0; i<32; i++) a[i] = y[i] | m[i];
    for (int i=0; i<32; i++) cout << a[i];
    cout << endl;
    for (int i=0; i<32; i++) a[i] = y[i] ^ m[i];
    for (int i=0; i<32; i++) cout << a[i];
    cout << endl;
}