#865 · #2425 · Bitwise XOR of All Pairings(所有数对的异或值总和)

You are given two 0-indexed arrays nums1 and nums2 of non-negative integers. Consider every pairing (i, j) with 0 <= i < n and 0 <= j < m, and let nums3 contain the XOR of each such pair. Return the bitwise XOR of all elements of nums3. Constraints: 1 <= nums1.length, nums2.length <= 10^5, 0 <= nums1[i], nums2[j] <= 10^9.