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

int in(){int x;scanf("%d",&x);return x;}

signed main(){

  bitset<32> a(in()),b(in());
  cout<< (a&b) <<endl;
  cout<< (a|b) <<endl;
  cout<< (a^b) <<endl;
  

}
