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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    unsigned int n[5];
    cin >> n[0] >> n[1];
    
    // AND
    n[2] = n[0] & n[1];
    // OR
    n[3] = n[0] | n[1];
    // XOR
    n[4] = n[0] ^ n[1];
    
    for(int i = 2;i < 5;++i){
        cout << bitset<32>(n[i]) << endl;
    }
}