#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

long long a[301][301] = {};

bool check(vector<pair<int, int>> v)
{
    long long sum = 0;
    int ind = -1;
    for (int i = 0; i < v.size(); i++)
    {
        sum += a[v[i].first][v[i].second];
        if (sum < 0)
        {
            ind = i;
            long long sum1 = 0;
            bool ans = 1;
            for (int j = ind + 1; j < v.size(); j++)
            {
                sum1 += a[v[j].first][v[j].second];
                if (sum1 < 0)
                {
                    ans = 0;
                    i = j - (j != i - 1);
                    break;
                }
            }
            if(ans)
                for (int j = 0; j < ind + 1; j++)
                {
                    sum1 += a[v[j].first][v[j].second];
                    if (sum1 < 0)
                        ans = 0;
                }
            if (ans)
            {
                for (int i = ind + 1; i < v.size(); i++)
                    cout << v[i].first + 1 << " " << v[i].second + 1 << endl;
                for (int i = 0; i < ind + 1; i++)
                    cout << v[i].first + 1 << " " << v[i].second + 1 << endl;
                exit(0);
            }
        }
    }
    ind = -1;
    sum = 0;
    for (int i = ind + 1; i < v.size(); i++)
    {
        sum += a[v[i].first][v[i].second];
        if (sum < 0)
            return 0;
    }
    for (int i = 0; i < ind + 1; i++)
    {
        sum += a[v[i].first][v[i].second];
        if (sum < 0)
            return 0;
    }
    for (int i = ind + 1; i < v.size(); i++)
        cout << v[i].first + 1 << " " << v[i].second + 1 << endl;
    for (int i = 0; i < ind + 1; i++)
        cout << v[i].first + 1 << " " << v[i].second + 1 << endl;
    exit(0);
}

int main()
{
    int n, m; cin >> n >> m;
    if (n == 1 && m > 2 || m == 1 && n > 2 || n % 2 != 0 && m % 2 != 0)
        cout << -1, exit(0);
    long long sum = 0;
    int posx = -1, posy = -1;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
        {
            cin >> a[i][j];
            if (a[i][j] < 0)
                posx = i, posy = j;
            sum += a[i][j];
        }
    if (sum < 0)
        cout << -1, exit(0);
    if (n % 2 == 0)
    {
        vector<pair<int, int>> v;
        for (int i = 0; i < m; i++)
            v.push_back({ 0, i });
        for (int i = 1; i < n; i++)
        {
            if (i % 2 == 0)
                for (int j = 1; j < m; j++)
                    v.push_back({ i, j });
            else
                for (int j = m - 1; j > 0; j--)
                    v.push_back({ i, j });
        }
        for (int i = n - 1; i > 0; i--)
            v.push_back({ i, 0 });
        check(v);
    }
    if(m % 2 == 0)
    {
        vector <pair<int, int>> v;
        for (int i = 0; i < n; i++)
            v.push_back({ i, 0 });
        for (int i = 1; i < m; i++)
        {
            if (i % 2 == 0)
                for (int j = 1; j < n; j++)
                    v.push_back({ j, i });
            else
                for (int j = n - 1; j > 0; j--)
                    v.push_back({ j, i });
        }
        for (int i = m - 1; i > 0; i--)
            v.push_back({ 0, i });
        check(v);
    }
    cout << -1 << endl;
}