Problem C: Bitset I - Bit Operation II

"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $162$ 正确数量 $119$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签 STL

Bit Operation II

Given two non-negative decimal integers aa and bb, 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.

abab
Output Print results of AND, OR and XOR in a line respectively.
8 10
00000000000000000000000000001000
00000000000000000000000000001010
00000000000000000000000000000010

Constraints

  • 0a,b23210≤a,b≤232−1