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 <bitset>
#include <iostream>

int main(int argc, char *argv[]) {
  long a, b;
  std::cin >> a >> b;
  std::bitset<32> abs(a), bbs(b);
  std::cout << (abs & bbs) << std::endl
            << (abs | bbs) << std::endl
            << (abs ^ bbs) << std::endl;
}