#include <climits>

int nr_sa(int a[100][100], int n, int m) {
    int i, j, counter = 0;
    int bmin[100], bmax[100];
    int cmin[100], cmax[100];
    for (i = 0; i < n; i++) bmin[i] = INT_MAX, bmax[i] = 0;
    for (i = 0; i < m; i++) cmin[i] = INT_MAX, cmax[i] = 0;
    for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) {
            bmin[i] = min(bmin[i], a[i][j]);
            bmax[i] = max(bmax[i], a[i][j]);
            cmin[j] = min(cmin[j], a[i][j]);
            cmax[j] = max(cmax[j], a[i][j]);
        }
    }

    for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) {
            if ((a[i][j] == bmin[i] && a[i][j] == cmax[j]) || (a[i][j] == bmax[i] && a[i][j] == cmin[j])) {
                counter++;
            }

        }
    }
    return counter;

}