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
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		long a = sc.nextLong();
		long b = sc.nextLong();
		int bitArrayA[] = new int[32];
		int bitArrayB[] = new int[32];

		for(int i = 0; a > 0; i++) {
			bitArrayA[i] = (int)(a % 2);
			a /= 2;
		}
		for(int i = 0; b > 0; i++) {
			bitArrayB[i] = (int)(b % 2);
			b /= 2;
		}

		//AND
		for(int i = 0; i < 32; i++) {
			System.out.print(bitArrayA[31 - i] * bitArrayB[31 - i]);
		}
		System.out.println();
		//OR
		for(int i = 0; i < 32; i++) {
			if(bitArrayA[31 - i] + bitArrayB[31 - i] > 0) System.out.print(1);
			else System.out.print(0);
		}
		System.out.println();
		//XOR
		for(int i = 0; i < 32; i++) {
			System.out.print((bitArrayA[31 - i] + bitArrayB[31 - i]) % 2);
		}
		System.out.println();
	}

}

