#include #pragma GCC optimize ("Ofast") #pragma GCC optimize ("unroll-loops") using namespace std; int n , m , q ; int kv[1002][1002] ; void LC( int x , int y ) { for ( int i = 1 ; i <= max(n,m) ; i++ ) { if ( i <= n ) kv[i][y] -= max( i-x , x-i ) ; if ( i <= m ) kv[x][i] -= max( i-y , y-i ) ; } } void S( ) { cin >> n >> m >> q ; for ( int i = 1 ; i <= n ; i++ ) for ( int j = 1 ; j <= m ; j++ ) cin >> kv[i][j] ; } void E( ) { int x , y ; for ( int g = 1 ; g <= q ; g++ ) { cin >> x >> y ; LC( x , y ) ; } for ( int i = 1 ; i <= n ; i++ ) { for ( int j = 1 ; j <= m ; j++ ) { cout << kv[i][j] << " " ; } cout << endl ; } } int main() { #ifdef ONLINE_JUDGE freopen("scenery.in", "r", stdin); freopen("scenery.out", "w", stdout); #endif ios_base::sync_with_stdio(0); cin.tie(NULL);cout.tie(NULL); S( ) ; E( ) ; return 0 ; }