#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
    int n, m;
    cin >> n >> m;

    int mat[n][m];

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

            v.push_back(make_pair(mat[i][j], make_pair(i, j)));
        }
    }

    sort(v.begin(), v.end());

    int res = 0;
    int di[] = {-1, 1, 0, 0};
    int dj[] = {0, 0, -1, 1};
    vector<vector<bool>> visited(n, vector<bool>(m, false));
    for(int i = 0; i < v.size(); i++) {
        int si = v[i].second.first;
        int sj = v[i].second.second;

        if(!visited[si][sj]) {
            res++;

            visited[si][sj] = true;

            queue<int> q;
            q.push(si);
            q.push(sj);

            while(!q.empty()) {
                int ci = q.front();
                q.pop();
                int cj = q.front();
                q.pop();

                for(int k = 0; k < 4; k++) {
                    int ti = ci + di[k];
                    int tj = cj + dj[k];

                    if(ti >= 0 and ti < n and tj >= 0 and tj < m and !visited[ti][tj] and mat[ci][cj] <= mat[ti][tj]) {
                        q.push(ti);
                        q.push(tj);
                        visited[ti][tj] = true;
                    }
                }

            }
        }



    }
    cout << res << endl;

    return 0;
}