You are given an integer array nums of length n and a $2 {D}$ integer array queries where queries[i] = [l_i, r_i, k_i, v_i].

For each query queries[i], iterate through every index idx such that $l_i \leq idx \leq r_i$ and $(idx - l_i) \bmod k_i = 0$, and update:

nums[idx] = (nums[idx] * v_i) % (10^9 + 7)

After executing all queries in the given order, return the bitwise XOR sum of all elements in nums.

Constraints:

• $1 \leq n =$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^9$

• $1 \leq q =$ queries.length $\leq 10^5$

• queries[i] $= [l_i, r_i, k_i, v_i]$

• $0 \leq l_i \leq r_i < n$

• $1 \leq k_i \leq n$

• $1 \leq v_i \leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.