Problem:
Bit Operation II

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.

Input

The input is given in the following format.

$a \; b$

Output

Print results of AND, OR and XOR in a line respectively.

Constraints

$0 \leq a, b \leq 2^{32} - 1$

Sample Input 1

8 10

Sample Output 1

00000000000000000000000000001000
00000000000000000000000000001010
00000000000000000000000000000010

Solution in JAVA (judge verdict: Accepted)

import java.util.Scanner;

public class Main {

	static Scanner scan = new Scanner(System.in);

	//0埋め
	static String zeroLine(String a) {
		String zero = "";
		if(a.length() < 32) {

			for(int i=0; i<32-a.length(); i++) {
				zero += "0";
			}
		}
		return zero + a;
	}

	//文字列の出力
	static void printStr(String a) {

		for(int i=a.length()-32; i<a.length(); i++) {
			System.out.print(a.charAt(i));
		}
		System.out.println();
	}


	public static void main(String args[]) {

		Long num1 = scan.nextLong();
		Long num2 = scan.nextLong();

		//2進数
		printStr(zeroLine(Long.toBinaryString(num1 & num2)));
		//
		printStr(zeroLine(Long.toBinaryString(num1 | num2)));
		//
		printStr(zeroLine(Long.toBinaryString(num1 ^ num2)));
	}
}