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;

#define int long long

void hoge(bool bit[], int x){
  for(int count = 1; x; x/=2) bit[count++] = x%2;
}

signed main(){
  bool bit[40] = {}, bit2[40] = {};
  int a, b;
  
  cin>>a>>b;

  hoge(bit,a); hoge(bit2,b);
  
  for(int i = 32; i; i--) cout<<(bit[i]&bit2[i]);
  cout<<endl;
  for(int i = 32; i; i--) cout<<(bit[i]|bit2[i]);
  cout<<endl;
  for(int i = 32; i; i--) cout<<(bit[i]^bit2[i]);
  cout<<endl;
  
  return 0;
}