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;
class Main {
	public static void main(String[] args) {
		try(Scanner sc = new Scanner(System.in)) {
			// unsigned int
			long a = sc.nextLong();
			long b = sc.nextLong();

			System.out.println(toPaddedBinaryString(a&b));
			System.out.println(toPaddedBinaryString(a|b));
			System.out.println(toPaddedBinaryString(a^b));
		}
	}
	/**
	 * 0パディングするのである
	 * @param bin バイナリするlong
	 * @return
	 */
	public static String toPaddedBinaryString(long bin) {
		String result = String.format("%32s", Long.toBinaryString(bin)).replaceAll(" ", "0");
		if(result.length()>32)
			return result.substring(result.length()-32);
		return result;
	}
}