问题 A: A boring problem

Farmer John, a very boring man, gives $\mathrm{<br>}$Q boring queries to Bessie. The $\mathrm{<br>}$i-th query consists of four integers ${\mathrm{<br>}}_{}$, ${\mathrm{<br>}}_{}$, ${\mathrm{<br>}}_{}$ and ${\mathrm{<br>}}_{}$ and asks her the following: when the rectangular region of the grid bounded by (and including) the ${\mathrm{<br>}}_{}$-th row, $x_{i,2}$-th row, $y_{i,1}$-th column and $y_{i,2}$-th column is cut out, how many connected components consisting of blue squares there are in the region?

The input is given from Standard Input in the following format:

$N \qquad M \qquad Q$

$S_{1,1}..S_{1,M}$

....

$S_{N,1}..S_{N,M}$

$x_{1,1} \quad y_{1,1} \quad x_{1,2} \quad y_{1,2} $

...

$x_{Q,1} \quad y_{Q,1} \quad x_{Q,2} \quad y_{Q,2}$

3 4 4
1101
0110
1101
1 1 3 4
1 1 3 1
2 2 3 4
1 2 2 4

3
2
2
2