#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = 500 + 5;
const int OO = 1e9 + 5;

int h, w, x[N][N];
bool vis[N][N];
priority_queue<pair<int, pair<int, int>>> pq;

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

void flow(int a, int b) {
    vis[a][b] = true;
    for (int i = 0; i < 4; ++i) {
        int newA = a + dx[i];
        int newB = b + dy[i];
        if (newA < h && newA >= 0 && newB < w && newB >= 0 && !vis[newA][newB] && x[newA][newB] <= x[a][b]) {
            flow(newA, newB);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> h >> w;
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            cin >> x[i][j];
            if (x[i][j] > 1) {
                pq.push({x[i][j], {i, j}});
            }
        }
    }
    int answer = 0;
    while (!pq.empty()) {
        auto current_square = pq.top();
        pq.pop();
        auto position = current_square.second;
        if (!vis[position.first][position.second]) {
            flow(position.first, position.second);
            ++answer;
        }
    }
    cout << answer << '\n';
    return 0;
}