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 C# (judge verdict: Accepted)

using System;
using System.Linq;//リストの使用
using System.Collections.Generic;
class Program
{
	static void Main()
	{
    
    string[] input = Console.ReadLine().Split(' ');
		long a = long.Parse(input[0]);
		long b = long.Parse(input[1]);

    Console.WriteLine(Convert.ToString(a&b, 2).PadLeft(32, '0'));

    Console.WriteLine(Convert.ToString(a|b, 2).PadLeft(32, '0'));

    Console.WriteLine(Convert.ToString(a^b, 2).PadLeft(32, '0'));
	}
}