#include <iostream>
#include <vector>
#include <cstdio>
#include <map>

using namespace std;

int n, m;
int color[103][103];
int mas[103][103];
int fl = 0;
vector <pair <int, int> > answer;
int shet = 0;
void dfs(int x, int y) {
    color[x][y] = 1;
    int dx[] = {0, 0, -1, 1};
    int dy[] = {1, -1, 0, 0};
    for(int i = 0; i < 4; ++i) {
        if((-1 < x + dx[i]) && (x + dx[i] < n + 2) && (-1 < y + dy[i]) && (y + dy[i] < m + 2)) {
            if(color[x + dx[i]][y + dy[i]] == 0 && (mas[x + dx[i]][y + dy[i]] >= mas[x][y])) {
                dfs(x + dx[i], y + dy[i]);
            }
        }
    }
    color[x][y] = 2;
}

int main() {
    cin >> n >> m;
    for(int i = 0; i < 103; ++i)
        for(int j = 0; j < 103; ++j)
            mas[i][j] = 100010;
    for(int i = 1; i < n + 1; ++i)
        for(int j = 1; j < m + 1; ++j)
            cin >> mas[i][j];
    for(int i = 1; i < n + 1; ++i)
        for(int j = 1; j < m + 1; ++j)
            if(color[i][j] != 2) {
                int dx[] = {0, 0, -1, 1};
                int dy[] = {1, -1, 0, 0};
                for(int z = 0; z < 4; ++z) {
                    if((-1 < i + dx[z]) && (i + dx[z] < n + 2) && (-1 < j + dy[z]) && (j + dy[z] < m + 2)) {
                        if(mas[i][j] > mas[i + dx[z]][j + dy[z]])
                            fl = 1;
                    }
                }
            if(fl == 1)
                dfs(i, j);
            fl = 0;
            }
    int vodostok = 0;
    for(int i = 1; i < n + 1; ++i)
        for(int j = 1; j < m + 1; ++j)
            if(color[i][j] != 2) {
                ++vodostok;
                dfs(i, j);
            }
    cout << vodostok;
}