Handling Sum Queries After Update

Support three operations on two equal-length arrays: flip a range of bits in nums1, add p * nums1[i] to each nums2[i], and report the sum of nums2. The challenge is to handle up to 1e5 operations efficiently by maintaining counts of ones under range flips (e.g., with a segment tree with lazy flip) and using that count to update/report nums2's sum in O(log n) per query.