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, update nums[idx] to $(`nums[idx]` imes v_i) \pmod{10^9 + 7}$ for every index idx such that $l_i \leq idx \leq r_i$ and $(idx - l_i)$ is divisible by $k_i$ (that is, $idx = l_i, l_i + k_i, l_i + 2 \cdot k_i, \dots$).

Return the bitwise XOR sum of all elements in nums after processing all queries in the given order.

Constraints:

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

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

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

• 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.