Codeforces Round 571 (Div. 2)
E
Vus the Cossack and a Field
Codeforces
2500
原题
← DF →
翻译中…

Vus the Cossack has a field with dimensions $n \times m$, which consists of "0" and "1". He is building an infinite field from this field. He is doing this in this way:

翻译中…
  1. He takes the current field and finds a new inverted field. In other words, the new field will contain "1" only there, where "0" was in the current field, and "0" there, where "1" was.
  2. To the current field, he adds the inverted field to the right.
  3. To the current field, he adds the inverted field to the bottom.
  4. To the current field, he adds the current field to the bottom right.
  5. He repeats it.
翻译中…

For example, if the initial field was:

翻译中…

$\begin{matrix} 1 & 0 & \\ 1 & 1 & \\ \end{matrix}$

翻译中…

After the first iteration, the field will be like this:

翻译中…

$\begin{matrix} 1 & 0 & 0 & 1 \\ 1 & 1 & 0 & 0 \\ 0 & 1 & 1 & 0 \\ 0 & 0 & 1 & 1 \\ \end{matrix}$

翻译中…

After the second iteration, the field will be like this:

翻译中…

$\begin{matrix} 1 & 0 & 0 & 1 & 0 & 1 & 1 & 0 \\ 1 & 1 & 0 & 0 & 0 & 0 & 1 & 1 \\ 0 & 1 & 1 & 0 & 1 & 0 & 0 & 1 \\ 0 & 0 & 1 & 1 & 1 & 1 & 0 & 0 \\ 0 & 1 & 1 & 0 & 1 & 0 & 0 & 1 \\ 0 & 0 & 1 & 1 & 1 & 1 & 0 & 0 \\ 1 & 0 & 0 & 1 & 0 & 1 & 1 & 0 \\ 1 & 1 & 0& 0 & 0 & 0 & 1 & 1 \\ \end{matrix}$

翻译中…

And so on...

翻译中…

Let's numerate lines from top to bottom from $1$ to infinity, and columns from left to right from $1$ to infinity. We call the submatrix $(x_1, y_1, x_2, y_2)$ all numbers that have coordinates $(x, y)$ such that $x_1 \leq x \leq x_2$ and $y_1 \leq y \leq y_2$.

翻译中…

The Cossack needs sometimes to find the sum of all the numbers in submatrices. Since he is pretty busy right now, he is asking you to find the answers!

翻译中…

Input

翻译中…

The first line contains three integers $n$, $m$, $q$ ($1 \leq n, m \leq 1\,000$, $1 \leq q \leq 10^5$) — the dimensions of the initial matrix and the number of queries.

翻译中…

Each of the next $n$ lines contains $m$ characters $c_{ij}$ ($0 \leq c_{ij} \leq 1$) — the characters in the matrix.

翻译中…

Each of the next $q$ lines contains four integers $x_1$, $y_1$, $x_2$, $y_2$ ($1 \leq x_1 \leq x_2 \leq 10^9$, $1 \leq y_1 \leq y_2 \leq 10^9$) — the coordinates of the upper left cell and bottom right cell, between which you need to find the sum of all numbers.

翻译中…

Output

翻译中…

For each query, print the answer.

翻译中…

Note

翻译中…

The first example is explained in the legend.

翻译中…

样例

Input #1
2 2 5
10
11
1 1 8 8
2 4 5 6
1 2 7 8
3 3 6 8
5 6 7 8
Output #1
32
5
25
14
4
InputCopy OutputCopy
Input #2
2 3 7
100
101
4 12 5 17
5 4 9 4
1 4 13 18
12 1 14 9
3 10 7 18
3 15 12 17
8 6 8 12
Output #2
6
3
98
13
22
15
3
InputCopy OutputCopy
题目信息
题号
1186E
时间限制
2 s
内存限制
256 MB
标签
分治
模拟
数学

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。