Two integers in their binary representations with n and m digits are given. Find XOR of these numbers.
Two integers n and m (1 ≤ n, m ≤ 500) are given. Then two numbers are given in binary representation, one number in one line.
Print one number - the result. Delete all leading zeros.