matrica nedoressena

#include <stdio.h>


int main() {
    int m,n;
    scanf("%d %d", &m, &n);
    int i,j, matrica[m][n];
    for(i = 0; i < m; i++) {
        for(j = 0; j < n; j++) {
            scanf("%d", &matrica[i][j]);
        }
    }
    int matricaB[m][n];
    for(i = 0; i < m; i++) {
        for(j = 0; j < n; j++) {
            matricaB[i][j] = matrica[i][j];
        }
    }
    for(i = 0; i < m; i++) {
        for(j = 0; j < n; j++) {
            //za 0
            if((matrica[i][j] > matrica[i-1][j]) && (matrica[i][j] > matrica[i][j+1]) && (matrica[i][j] > matrica[i+1][j]) && (matrica[i][j] > matrica[i][j-1])){
                matricaB[i][j] = 0;
            }
            if(i == 0 && j == 0){ //)|| (i == 0 && j == n-1) || (i == m-1 && j == 0) || (i == m-1 && j == n-1)) {
                if(matrica[i][j] > matrica[i][j+1] && matrica[i][j] > matrica[i+1][j]) {
                    matricaB[i][j]= 0;
                }
            }
            else if(i == 0 && j == n-1) {
                if(matrica[i][j] > matrica[i][j-1] && matrica[i][j] > matrica[i+1][j]){
                    matricaB[i][j] = 0;
                }
            }
            else if(i == m-1 && j == 0) {
                if(matrica[i][j] > matrica[i][j-1] && matrica[i][j] > matrica[i-1][j]) {
                    matricaB[i][j] = 0;
                }
            }
            else if(i == m-1 && j == n-1) {
                if(matrica[i][j] > matrica[i-1][j] && matrica[i][j] > matrica[i][j-1]) {
                    matricaB[i][j] = 0;
                }
            }

        }
    }
    for(i = 0; i < m; i++) {
        for(j = 0; j < n; j++) {
           printf("%d ", matricaB[i][j]);
        }
        printf("\n");
    }
    return 0;
}