#include <bits/stdc++.h>
using namespace std;
long long n, m;
long long a[202][202];
set<long long> R, C;
bool doRows() {
  for (long long i = 1; i <= n; i++) {
    long long s = 0;
    for (long long j = 1; j <= m; j++) s += a[i][j];
    if (s >= 0) continue;
    if (R.find(i) == R.end())
      R.insert(i);
    else
      R.erase(R.find(i));
    for (long long j = 1; j <= m; j++) a[i][j] *= -1;
  }
  for (long long j = 1; j <= m; j++) {
    long long s = 0;
    for (long long i = 1; i <= n; i++) s += a[i][j];
    if (s < 0) {
      return false;
    }
  }
  return true;
}
bool doCols() {
  for (long long j = 1; j <= m; j++) {
    long long s = 0;
    for (long long i = 1; i <= n; i++) s += a[i][j];
    if (s >= 0) continue;
    if (C.find(j) == C.end())
      C.insert(j);
    else
      C.erase(C.find(j));
    for (long long i = 1; i <= n; i++) a[i][j] *= -1;
  }
  for (long long i = 1; i <= n; i++) {
    long long s = 0;
    for (long long j = 1; j <= m; j++) s += a[i][j];
    if (s < 0) {
      return false;
    }
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= m; j++) {
      cin >> a[i][j];
    }
  }
  long long itr = 200;
  long long r = 1;
  while (itr--) {
    if (r) {
      bool ok = doRows();
      if (ok) {
        cout << R.size() << " ";
        for (auto &i : R) cout << i << " ";
        cout << "\n";
        cout << C.size() << " ";
        for (auto &i : C) cout << i << " ";
        cout << "\n";
        return 0;
      }
    } else {
      bool ok = doCols();
      if (ok) {
        cout << R.size() << " ";
        for (auto &i : R) cout << i << " ";
        cout << "\n";
        cout << C.size() << " ";
        for (auto &i : C) cout << i << " ";
        cout << "\n";
        return 0;
      }
    }
    r ^= 1;
  }
  assert(false);
  return 0;
}
