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.*;
public class Main {

	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		
		long x=in.nextLong(),y=in.nextLong();
		printBin(fillZero(Long.toBinaryString(x & y)));
		printBin(fillZero(Long.toBinaryString(x | y)));
		printBin(fillZero(Long.toBinaryString(x ^ y)));
	}
	
	static void printBin(String str) {
		for(int i=str.length()-32;i<str.length();i++)System.out.print(str.charAt(i));
		System.out.println();
	}
	
	static String fillZero(String str) {
		String zero="";
		if(str.length()<32) {
			for(int i=0;i<32-str.length();i++)zero+="0";
		}
		return zero.concat(str);
	}

}