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;

typedef unsigned long long int ull;

void printInBinary(ull n)
{
    char bin32[] = "00000000000000000000000000000000";
    
    for(int i = 31; i >= 0 && n; i--)
    {
        if(n & 1)
            bin32[i] = '1';
        n >>= 1;
    }
    
    cout << bin32 << "\n";
}

int main() 
{
    ull x, y, z;
    cin >> x >> y;
    
    z = (x & y);
    
    printInBinary(z);
    
    z = (x | y);
    
    printInBinary(z);
    
    z = (x ^ y);
    
    printInBinary(z);
    
    return 0;
}