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

void toBit(unsigned long x);



int main(void){
  unsigned long a,b;
  cin>>a>>b;
  toBit(a&b);
  toBit(a|b);
  toBit(a^b);
  return 0;
}

void toBit(unsigned long x){
  x=x%((unsigned long)pow(2,32));
  for(int i=31;i>=0;i--){
    if(pow(2,i)<=x){
      cout<<1;
      x-=pow(2,i);
    }
    else{
      cout<<0;
    }
  }
  cout<<endl;
}