Problems
XOR 2
XOR 2
Two integers in their binary representations with n and m digits are given. Find XOR of these numbers.
Input
Two integers n and m (1 ≤ n, m ≤ 500) are given. Then two numbers are given in binary representation, one number in one line.
Output
Print one number - the result. Delete all leading zeros.
Input example #1
4 3 0011 101
Output example #1
110
Input example #2
3 3 111 111
Output example #2
0
Input example #3
3 3 100 101
Output example #3
1