Leetcode 3653. XOR After Range Multiplication Queries I

Given nums and queries [l, r, k, v], each query multiplies every element at indices i = l, l+k, l+2k, ... ≤ r by v modulo 1e9+7; after all queries return the bitwise XOR of the final array. The core challenge is efficiently applying many strided (arithmetic-progression) multiplicative range updates under a large modulus and combining the results.