KVALIF_VGTU_D

#include <iostream>
using namespace std;
int main()
{
    int n, m;
    cin >> n >> m;
    int qq[n][m];
    for(int i = 0; i < n; i++)
    {
        for(int y = 0; y < m; y++)
        {
            cin >> qq[i][y];
        }
    }
    for(int i = 0; i < n; i++)
    {
        for(int y = 0; y < m; y++)
        {
            if(m == 1 && qq[i][y] == -1 && y == m-1 && i == n-1){cout <<qq[i-1][y]+1;}
            else if(m == 1 && qq[i][y] == -1 && y == 0 && i == 0){cout << qq[i+1][y]-1;}
            else if( qq[i][y] == -1 && y == 0){cout << (qq[i][y+1])-1;}
            else if( qq[i][y] == -1 && y == m-1){cout << (qq[i][y-1])+1;}
            else if( qq[i][y] == -1 ){cout << (qq[i][y-1])+1;}
        }
    }
    return 0;
}