#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int H,W,N,M,Q;
int A[5000][5000];

int dfs(int h, int w) {
    if (A[h][w]==0) return 0;
    REP(i,4) {
        int x = dxy[i], y = dxy[i+1];
        int nh = h+x, nw = w+y;
        if (nh < 0 || nw < 0) continue;
        if (A[nh][nw] == 0) continue;
        if (A[nh][nw] < A[h][w]) A[h][w] = dfs(nh, nw);
        if (A[nh][nw] > A[h][w]) {
            A[nh][nw] = A[h][w];
            dfs(nh, nw);
        }
    }
    return A[h][w];
}

void solve() {
    cin>>H>>W;
    
    REP(h,H)REP(w,W) {
        cin>>A[h][w];
        if (A[h][w]) A[h][w] = 10000 * h + w + 1;
    }
    REP(h,H)REP(w,W) {
        dfs(h,w);
    }
    set<int> ans;
    REP(h,H)REP(w,W) {
        if (A[h][w]) ans.insert(A[h][w]);
    }

    cout << ans.size() << endl;
}