#danglam228

#include <bits/stdc++.h>
using namespace std;
const int A = 100;
const int B = 100;
int m, n;
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    //freopen(".INP","r",stdin);
    //freopen(".OUT","w",stdout);
    int a[A][B];
    cin >> m >> n;
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n; ++j) {
            cin >> a[i][j];
        }
    }
    int dem = 0;
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n; ++j) {
            int d = a[i][j];
            bool check = true;

            if (i > 0 && a[i - 1][j] >= d) {
                check = false;
            }
            if (i < m - 1 && a[i + 1][j] >= d) {
                check = false;
            }
            if (j > 0 && a[i][j - 1] >= d) {
                check = false;
            }
            if (j < n - 1 && a[i][j + 1] >= d) {
                check = false;
            }

            if (check) {
                dem++;
            }
        }
    }
    cout << dem << endl;
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int n,m;
int moveX[]={1,-1,0,0};
int moveY[]={0,0,1,-1};
int a[105][105];
bool inside(int x,int y){
	return 1<=x&&x<=n&&1<=y&&y<=m;
}
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>a[i][j];
		}
	}
	int ans=0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			bool ok=true;
			for(int k=0;k<4;k++){
				int nextI=i+moveX[k],nextJ=j+moveY[k];
				if(inside(nextI,nextJ)){
					if(a[nextI][nextJ]>=a[i][j]){
						ok=false;
						break;
					}
				}
			}
			if(ok){
				++ans;
			}
		}
	}
	cout<<ans;
}