#include <cstdio>

#include <cstring>

#include <algorithm>

using namespace std;

const int N = ;

const int dx[] = {, , -, };

const int dy[] = {, , , -};

const int inf =  << ;

int n, m, tot = , a[N][N], ufs[N * N];

bool vis[N * N];

struct Node {

    int x, y, val;

    friend bool operator < (const Node &u, const Node &v) {

        return u.val < v.val;

    }

} b[N * N], c[N * N];

inline void read(int &X) {

    X = ; char ch = ; int op = ;

    for(; ch > ''|| ch < ''; ch = getchar())

        if(ch == '-') op = -;

    for(; ch >= '' && ch <= ''; ch = getchar())

        X = (X << ) + (X << ) + ch - ;

    X *= op;

}

inline int id(int x, int y) {

    return (x - ) * m + y;

}

int find(int x) {

    return ufs[x] == x ? x : ufs[x] = find(ufs[x]);

}

inline void merge(int x, int y) {

    int fx = find(x), fy = find(y);

    if(fx == fy) return;

    ufs[fx] = fy;

    if(vis[fx]) vis[fy] = ;

}

inline void ext(int x, int y) {

    for(int i = ; i < ; i++) {

        int tox = x + dx[i], toy = y + dy[i];

        if(a[tox][toy] <= a[x][y]) merge(id(tox, toy), id(x, y));

    }

}

int main() {

    read(n), read(m);

    for(int i = ; i <= n; i++)

        for(int j = ; j <= m; j++) {

            read(a[i][j]);

            if(a[i][j] > ) c[++tot] = (Node) {i, j, a[i][j]};

            else a[i][j] *= -;

            b[id(i, j)].x = i, b[id(i, j)].y = j, b[id(i, j)].val = a[i][j];

            ufs[id(i, j)] = id(i, j);

        }

    for(int i = ; i <= m + ; i++)

        a[][i] = a[n + ][i] = inf;

    for(int i = ; i <= n + ; i++)

        a[i][] = a[i][m + ] = inf;

    sort(b + , b +  + n * m);

    sort(c + , c +  + tot);

/*    for(int i = 1; i <= tot; i++)

        printf("%d %d %d\n", c[i].x, c[i].y, c[i].val);   */

    int ans = ;

    for(int j = , i = ; i <= tot; i++) {

        for(; j <= n * m && c[i].val >= b[j].val; j++)

            ext(b[j].x, b[j].y);

        int now = find(id(c[i].x, c[i].y));

        if(!vis[now]) {

            vis[now] = ;

            ans++;

        }

    }

    printf("%d\n", ans);

    return ;

}