#include <bits/stdc++.h>
using namespace std;

int n, m;
vector<vector<int>> heights;

void bfs(const vector<pair<int, int>>& sources, vector<vector<bool>>& visited) {
    queue<pair<int, int>> q;
    for (auto p : sources) {
        visited[p.first][p.second] = true;
        q.push(p);
    }
    int dr[] = {-1, 1, 0, 0};
    int dc[] = {0, 0, -1, 1};
    while (!q.empty()) {
        auto [r, c] = q.front(); q.pop();
        for (int d = 0; d < 4; d++) {
            int nr = r + dr[d], nc = c + dc[d];
            if (nr >= 0 && nr < n && nc >= 0 && nc < m && !visited[nr][nc] && heights[nr][nc] >= heights[r][c]) {
                visited[nr][nc] = true;
                q.push({nr, nc});
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    if (!(cin >> n >> m)) return 0;
    heights.assign(n, vector<int>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> heights[i][j];
        }
    }
    vector<vector<bool>> pacific(n, vector<bool>(m, false));
    vector<vector<bool>> atlantic(n, vector<bool>(m, false));
    vector<pair<int, int>> pac_sources, atl_sources;
    for (int i = 0; i < n; i++) {
        pac_sources.push_back({i, 0});
        atl_sources.push_back({i, m - 1});
    }
    for (int j = 0; j < m; j++) {
        pac_sources.push_back({0, j});
        atl_sources.push_back({n - 1, j});
    }
    bfs(pac_sources, pacific);
    bfs(atl_sources, atlantic);
    int cnt = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (pacific[i][j] && atlantic[i][j]) cnt++;
        }
    }
    cout << cnt << "\n";
    return 0;
}