Sum on parallelepiped

Input

The first line contains the dimensions of the table: $n$ , $m$ , $k$ ( $1 \leq n, m, k \leq 100$ 1 \leq n, m, k \leq 100). Then $n$ blocks of $m$ lines follow, each containing $k$ integers $a_{i, j, t}$ a_{i,j,t} ( $1 \leq a_{i, j, t} \leq 1000$ 1 \leq a_{i,j,t} \leq 1000). The blocks are separated by an empty line. The next line contains the integer $q$ ( $1 \leq q \leq 1 0^{6}$ 1 \leq q \leq 10^6) — the number of queries. Each of the next $q$ lines contains a query described by $l x_{i}$ lx_i, $l y_{i}$ ly_i, $l z_{i}$ lz_i, $r x_{i}$ rx_i, $r y_{i}$ ry_i, $r z_{i}$ rz_i ( $1 \leq l x_{i} \leq r x_{i} \leq n$ 1 \leq lx_i \leq rx_i \leq n, $1 \leq l y_{i} \leq r y_{i} \leq m$ 1 \leq ly_i \leq ry_i \leq m, $1 \leq l z_{i} \leq r z_{i} \leq k$ 1 \leq lz_i \leq rz_i \leq k).

Output

Print $q$ numbers, one per line, which are the answers to the queries.

Examples

Example 1

Loading