#include <bits/stdc++.h>
using namespace std;
const int mod = 1LL * 1000 * 1000 * 1000 + 7;
const int inf = 1000 * 1000 * 1000;
const int rad = 1000;
const int maxn = 100 + 10;
int a[maxn][maxn];
int s[maxn][4];
int mark[maxn][5];
int n, m;
priority_queue<pair<int, int> > q;
inline void relax1(int j) {
  mark[j][1]++;
  s[j][1] *= -1;
  for (int i = 1; i <= m; ++i) {
    s[i][2] -= a[j][i];
    a[j][i] *= -1;
    s[i][2] += a[j][i];
    if (s[i][2] < 0) q.push(pair<int, int>(i, 2));
  }
}
inline void relax2(int j) {
  mark[j][2]++;
  s[j][2] *= -1;
  for (int i = 1; i <= n; ++i) {
    s[i][1] -= a[i][j];
    a[i][j] *= -1;
    s[i][1] += a[i][j];
    if (s[i][1] < 0) q.push(pair<int, int>(i, 1));
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m;
  int sum = 0;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) {
      cin >> a[i][j];
      s[i][1] += a[i][j];
      s[j][2] += a[i][j];
    }
  for (int i = 1; i <= n; ++i)
    if (s[i][1] < 0) q.push(pair<int, int>(i, 1));
  for (int i = 1; i <= m; ++i)
    if (s[i][2] < 0) q.push(pair<int, int>(i, 2));
  while (q.size()) {
    pair<int, int> T = q.top();
    q.pop();
    if (s[T.first][T.second] < 0)
      if (T.second == 1)
        relax1(T.first);
      else
        relax2(T.first);
  }
  int cnt = 0;
  for (int i = 1; i <= n; ++i)
    if (mark[i][1] % 2 == 1) cnt++;
  cout << cnt << ' ';
  for (int i = 1; i <= n; ++i)
    if (mark[i][1] % 2 == 1) cout << i << ' ';
  cout << endl;
  cnt = 0;
  for (int i = 1; i <= m; ++i)
    if (mark[i][2] % 2 == 1) cnt++;
  cout << cnt << ' ';
  for (int i = 1; i <= m; ++i)
    if (mark[i][2] % 2 == 1) cout << i << ' ';
  cout << endl;
  return 0;
}
