#include <bits/stdc++.h>

#define el '\n'
#define ll long long
#define ld long double

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

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

bool valid(int x, int y) {
    return x >= 0 && x < h && y >= 0 && y < w;
}

void testCase() {
    cin >> h >> w;

    int g[h][w];
    vector<pair<int, pair<int, int>>> v;
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            cin >> g[i][j];

            if (g[i][j] > 1)
                v.push_back({g[i][j], {i, j}});
        }
    }

    sort(v.rbegin(), v.rend());

    bool b[h][w];
    memset(b, 0, sizeof b);

    int sol = 0;
    for (auto &e: v) {
        int i = e.second.first, j = e.second.second;

        if (!b[i][j])
            b[i][j] = 1, sol++;

        for (int k = 0; k < 4; k++) {
            int x = i + dx[k], y = j + dy[k];

            if (valid(x, y) && g[x][y] <= g[i][j])
                b[x][y] = 1;
        }
    }

    cout << sol;
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}