#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }

void in_impl(){};
template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }
#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );

template < typename T > struct getv_fmt;
template <> struct getv_fmt<       int >{ static constexpr const char *fmt = "%d"; };
template <> struct getv_fmt< long long >{ static constexpr const char *fmt = "%lld"; };
template < typename T > void getv( std::vector< T > &v ){ for_each( begin( v ), end( v ), []( T &a ){ scanf( getv_fmt< T >::fmt, &a ); } ); };

template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )
#define DRANGE( c, p ) begin( c ), begin( c ) + ( p ), end( c )

#define SZ( v ) ( (int)( v ).size() )
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl


// 累積和による区間 Sum クエリ
// 前処理 O( HW )
// クエリ O( 1 )
class PartialSum2d
{
private:
	const int H, W;
	vector< vector< long long > > src, csum;
	bool isSolved = false;

public:
	PartialSum2d( const int h, const int w ) : H( h ), W( w ), src( H, vector< long long >( W ) ) {}
	PartialSum2d( const vector< vector< long long > > &s ) : H( s.size() ), W( s[0].size() ), src( s ) {}
	PartialSum2d( const vector< vector< int > > &s ) : H( s.size() ), W( s[0].size() ), src( H, vector< long long >( W, 0 ) )
	{
		for ( int i = 0; i < H; ++i )
		{
			for ( int j = 0; j < W; ++ j )
			{
				src[i][j] = s[i][j];
			}
		}
		return;
	}


	PartialSum2d( const vector< string > &s ) : H( s.size() ), W( s[0].size() ), src( H, vector< long long >( W, 0 ) )
	{
		for ( int i = 0; i < H; ++i )
		{
			for ( int j = 0; j < W; ++ j )
			{
				src[i][j] = s[i][j] - '0';
			}
		}
		return;
	}

	int get( const int y, const int x ) const
	{
		return src[y][x];
	}

	void set( const int y, const int x, const long long v )
	{
		src[y][x] = v;
		isSolved = false;
		
		return;
	}

	long long sum( const int y1, const int x1, const int y2, const int x2 )
	{
		if ( !isSolved )
		{
			solve();
		}
		return csum[ y2 + 1 ][ x2 + 1 ] - csum[ y2 + 1 ][ x1 ] - csum[ y1 ][ x2 + 1 ] + csum[ y1 ][ x1 ];
	}

private:
	void solve()
	{
		csum.clear();
		csum.resize( H + 1, vector< long long >( W + 1 ) );

		for ( int i = 0; i < H; ++i )
		{
			partial_sum( src[i].begin(), src[i].end(), csum[ i + 1 ].begin() + 1 );
		}

		for ( int i = 0; i < H; ++i )
		{
			for ( int j = 0; j <= W; ++j )
			{
				csum[ i + 1 ][j] += csum[i][j];
			}
		}

		isSolved = true;
		return;
	}
};
// PartialSum2d( H, W )
// PartialSum2d( SRC )
// consecutiveSums2d( vector< string > SRC )
// get( y, x )
// set( y, x, value )
// sum( y1, x1, y2, x2 ) ←それぞれの座標軸に対して閉区間

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	IN( int, H, W, Q );

	VS board( H );
	cin >> board;

	PartialSum2d psum_blues( H, W ), psum_ver( H - 1, W ), psum_hor( H, W - 1 );
	REP( i, H )
	{
		REP( j, W )
		{
			if ( board[i][j] == '1' )
			{
				psum_blues.set( i, j, 1 );
			}
			if ( i + 1 < H && board[i][j] == '1' && board[ i + 1 ][j] == '1' )
			{
				psum_ver.set( i, j, 1 );
			}
			if ( j + 1 < W && board[i][j] == '1' && board[i][ j + 1 ] == '1' )
			{
				psum_hor.set( i, j, 1 );
			}
		}
	}

	REP( Q )
	{
		IN( int, y1, x1, y2, x2 );
		--y1, --x1, --y2, --x2;

		cout << psum_blues.sum( y1, x1, y2, x2 )
			- psum_ver.sum( y1, x1, y2 - 1, x2 )
			- psum_hor.sum( y1, x1, y2, x2 - 1 ) << endl;
	}

	return 0;
}


Measured memory_bytes: 194048