#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pll=pair<ll, ll>;

vector<vector<ll>> vec;
vector<vector<bool>> check;

void v(ll i, ll j){
    check[i][j]=true;
    if (!check[i+1][j] && vec[i][j]<=vec[i+1][j]) v(i+1, j);
    if (!check[i-1][j] && vec[i][j]<=vec[i-1][j]) v(i-1, j);
    if (!check[i][j+1] && vec[i][j]<=vec[i][j+1]) v(i, j+1);
    if (!check[i][j-1] && vec[i][j]<=vec[i][j-1]) v(i, j-1);
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	ll n, m; cin >> n >> m;
    vec.assign(n+2, vector<ll> (m+2, 1e9+1));
    check.assign(n+2, vector<bool> (m+2, true));
    for (ll i=1; i<=n; i++)
        for (ll j=1;j<=m;j++){
            cin >> vec[i][j];
            check[i][j]=false;
            if (vec[i][j]==0){
                vec[i][j]=1e9+1;
                check[i][j]=true;
            }
        }
    vector<pll> out;
    for (ll i=1; i<=n; i++){
        for (ll j=1;j<=m;j++){
            if (!check[i][j]){
                if (vec[i][j]<vec[i+1][j] && vec[i][j]<vec[i-1][j] && vec[i][j]<vec[i][j+1] && vec[i][j]<vec[i][j-1]){
                    out.push_back({i, j});
                    v(i, j);
                }
            }
        }
    }
    for (ll i=1; i<=n; i++){
        for (ll j=1;j<=m;j++){
            if (!check[i][j]){
                out.push_back({i, j});
                v(i, j);
            }
        }
    }
    cout << out.size() << '\n';
    for (auto& z:out) cout << z.first << ' ' << z.second << '\n';
}