Grid Query 2

The array has $10^5$ rows and $10^5$ columns, and every value starts at 0. Row numbers increase downward and column numbers increase to the right. The cell in row $i$ and column $j$ is written as $(i-1,j-1)$.

Lawali wants to run $Q$ operations of the following two types, just so you can suffer more watching the results.

1. $X_1$ $Y_1$ $X_2$ $Y_2$ $V$: Add $V$ to the value of every cell between $(X_1,Y_1)$ and $(X_2,Y_2)$. ($V > 0$)
2. $X_1$ $Y_1$ $X_2$ $Y_2$ $0$: Compute the sum of the values of every cell between $(X_1,Y_1)$ and $(X_2,Y_2)$ and print it.

The first line contains $Q$. ($1 \le Q \le 2.5 \times 10^5$)

Each of the next $Q$ lines contains five integers $A_i, B_i, C_i, D_i, K_i$. ($0 \le A_i, B_i, C_i, D_i, K_i < 2^{31}$)

last_ans is 0 at the start, and it holds the most recently printed value. The parameters of the $i$-th query are computed as follows.

$X_{i1} = (A_i \oplus \text{last\_ans}) \bmod 10^5$, $Y_{i1} = (B_i \oplus \text{last\_ans}) \bmod 10^5$, $X_{i2} = (C_i \oplus \text{last\_ans}) \bmod 10^5$, $Y_{i2} = (D_i \oplus \text{last\_ans}) \bmod 10^5$, $V_i = (K_i \oplus \text{last\_ans}) \bmod (10^9+7)$

$X_{i1}, Y_{i1}, X_{i2}, Y_{i2}$ are the $X_1, Y_1, X_2, Y_2$ of the $i$-th query. They satisfy $0 \le X_{i1}, Y_{i1}, X_{i2}, Y_{i2} < 10^5$, $0 \le V_i < 10^9+7$, $X_{i1} \le X_{i2}$, and $Y_{i1} \le Y_{i2}$.

There are at most 50000 type 1 queries, and at least one type 2 query.

For each type 2 query, print the sum modulo $10^9+7$ on its own line.