#include #include using namespace std;

int main() { int n, m; cin >> n >> m;

vector<vector<int>> h(n, vector<int>(m));
for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
        cin >> h[i][j];
    }
}


int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};

int count = 0;

for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
        bool isValley = true;
        
        
        for (int k = 0; k < 8; k++) {
            int ni = i + dx[k];
            int nj = j + dy[k];
            
            if (ni >= 0 && ni < n && nj >= 0 && nj < m) {
               
                if (h[i][j] > h[ni][nj]) {
                    isValley = false;
                    break;
                }
            }
        }
        
        if (isValley) {
            count++;
        }
    }
}

cout << count << endl;

return 0;

}