#include <bits/stdc++.h>
using namespace std;
const int N = 200;
int n, m;
int ara[N][N];
int change[2][N];
int negcol(void) {
  for (int j = 0; j < m; ++j) {
    int cnt = 0;
    for (int i = 0; i < n; ++i) cnt += ara[i][j];
    if (cnt < 0) return j;
  }
  return -1;
}
int negrow(void) {
  for (int i = 0; i < n; ++i) {
    int cnt = 0;
    for (int j = 0; j < m; ++j) cnt += ara[i][j];
    if (cnt < 0) return i;
  }
  return -1;
}
int main(void) {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j) scanf("%d", &ara[i][j]);
  while (1) {
    int col = negcol();
    if (col != -1) {
      for (int i = 0; i < n; ++i) ara[i][col] *= -1;
      change[0][col] ^= 1;
      continue;
    }
    int row = negrow();
    if (row != -1) {
      for (int j = 0; j < m; ++j) ara[row][j] *= -1;
      change[1][row] ^= 1;
      continue;
    }
    break;
  }
  int cnt;
  cnt = 0;
  for (int i = 0; i < n; ++i) cnt += change[1][i];
  printf("%d", cnt);
  for (int i = 0; i < n; ++i)
    if (change[1][i]) printf(" %d", i + 1);
  puts("");
  cnt = 0;
  for (int i = 0; i < m; ++i) cnt += change[0][i];
  printf("%d", cnt);
  for (int i = 0; i < m; ++i)
    if (change[0][i]) printf(" %d", i + 1);
  puts("");
  return 0;
}
