#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

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

    int n, m;
    cin >> n >> m;

    vector<vector<int>> a(n, vector<int>(m));
    vector<int> minR(n, 2e9);
    vector<int> maxC(m, -2e9);

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> a[i][j];
            minR[i] = min(minR[i], a[i][j]);
            maxC[j] = max(maxC[j], a[i][j]);
        }
    }

    vector<pair<int, int>> kq;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (a[i][j] == minR[i] && a[i][j] == maxC[j]) {
                kq.push_back({i + 1, j + 1});
            }
        }
    }

    if (kq.size() == 0) {
        cout << 0;
    } else {
        cout << kq.size() << "\n";
        for (int i = 0; i < kq.size(); i++) {
            cout << kq[i].first << " " << kq[i].second << "\n";
        }
    }

    return 0;
}