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 JAVA):

Solution:
import java.util.Scanner;

public class Main {
	public static void main(String[] args){
		String a, b;
		long n;
		try (Scanner sc = new Scanner(System.in)) {
			a = sc.next();
			b = sc.next();
			n = Long.parseLong(a) & Long.parseLong(b);
			System.out.println(String.format("%32s", Long.toBinaryString(n)).replace(' ', '0'));
			n = Long.parseLong(a) | Long.parseLong(b);
			System.out.println(String.format("%32s", Long.toBinaryString(n)).replace(' ', '0'));
			n = Long.parseLong(a) ^ Long.parseLong(b);
			System.out.println(String.format("%32s", Long.toBinaryString(n)).replace(' ', '0'));
		}
	}
}