write a go solution for Description:
Vus the Cossack has a field with dimensions nxm, 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:

beginmatrix1&0&1&1&endmatrix

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

beginmatrix1&0&0&11&1&0&00&1&1&00&0&1&1endmatrix

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

beginmatrix1&0&0&1&0&1&1&01&1&0&0&0&0&1&10&1&1&0&1&0&0&10&0&1&1&1&1&0&00&1&1&0&1&0&0&10&0&1&1&1&1&0&01&0&0&1&0&1&1&01&1&0&0&0&0&1&1endmatrix

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<=x<=x_2 and y_1<=y<=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 Format:
The first line contains three integers n, m, q (1<=n,m<=1,000, 1<=q<=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<=qc_ij<=q1) — the characters in the matrix.

Each of the next q lines contains four integers x_1, y_1, x_2, y_2 (1<=x_1<=x_2<=10^9, 1<=y_1<=y_2<=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 Format:
For each query, print the answer.

Note:
The first example is explained in the legend.. Output only the code with no comments, explanation, or additional text.