#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
inline void chkmin(T1 &x, T2 y) {
  if (x > y) x = y;
}
template <typename T1, typename T2>
inline void chkmax(T1 &x, T2 y) {
  if (x < y) x = y;
}
inline int readChar();
template <class T = int>
inline T readInt();
template <class T>
inline void writeInt(T x, char end = 0);
inline void writeChar(int x);
inline void writeWord(const char *s);
static const int buf_size = 4096;
inline int getChar() {
  static char buf[buf_size];
  static int len = 0, pos = 0;
  if (pos == len) {
    pos = 0, len = fread(buf, 1, buf_size, stdin);
  }
  if (pos == len) {
    return -1;
  }
  return buf[pos++];
}
inline int readChar() {
  int c = getChar();
  while (c <= 32) {
    c = getChar();
  }
  return c;
}
template <class T>
inline T readInt() {
  int s = 1, c = readChar();
  T x = 0;
  if (c == '-') s = -1, c = getChar();
  while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();
  return s == 1 ? x : -x;
}
static int write_pos = 0;
static char write_buf[buf_size];
inline void writeChar(int x) {
  if (write_pos == buf_size)
    fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
  write_buf[write_pos++] = x;
}
template <class T>
inline void writeInt(T x, char end) {
  if (x < 0) writeChar('-'), x = -x;
  char s[24];
  int n = 0;
  while (x || !n) s[n++] = '0' + x % 10, x /= 10;
  while (n--) writeChar(s[n]);
  if (end) writeChar(end);
}
inline void writeWord(const char *s) {
  while (*s) writeChar(*s++);
}
struct Flusher {
  ~Flusher() {
    if (write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
  }
} flusher;
const int MAXN = 101;
int n, m;
int a[MAXN][MAXN];
int r[MAXN], c[MAXN], rf[MAXN], cf[MAXN];
int main() {
  n = readInt(), m = readInt();
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      a[i][j] = readInt();
    }
  }
  memset(r, 0, sizeof(r));
  memset(c, 0, sizeof(c));
  memset(rf, 0, sizeof(rf));
  memset(cf, 0, sizeof(cf));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      r[i] += a[i][j];
      c[j] += a[i][j];
    }
  }
  int order[2 * MAXN];
  for (int i = 0; i < n + m; i++) {
    order[i] = i;
  }
  while (true) {
    bool good = true;
    for (int i = 0; i < n; i++) {
      good &= r[i] >= 0;
    }
    for (int i = 0; i < m; i++) {
      good &= c[i] >= 0;
    }
    if (good) {
      break;
    }
    random_shuffle(order, order + n + m);
    for (int i = 0; i < n + m; i++) {
      if (order[i] < n) {
        int row = order[i];
        if (r[row] < 0) {
          rf[row] = 1 - rf[row];
          for (int j = 0; j < m; j++) {
            int dif = -2 * a[row][j];
            a[row][j] *= -1;
            r[row] += dif;
            c[j] += dif;
          }
        }
      } else {
        int col = order[i] - n;
        if (c[col] < 0) {
          cf[col] = 1 - cf[col];
          for (int j = 0; j < n; j++) {
            int dif = -2 * a[j][col];
            a[j][col] *= -1;
            r[j] += dif;
            c[col] += dif;
          }
        }
      }
    }
  }
  int rc = 0, cc = 0;
  for (int i = 0; i < n; i++) {
    rc += rf[i];
  }
  for (int i = 0; i < m; i++) {
    cc += cf[i];
  }
  writeInt(rc);
  for (int i = 0; i < n; i++) {
    if (rf[i]) {
      writeChar(' ');
      writeInt(i + 1);
    }
  }
  writeChar('\n');
  writeInt(cc);
  for (int i = 0; i < m; i++) {
    if (cf[i]) {
      writeChar(' ');
      writeInt(i + 1);
    }
  }
  writeChar('\n');
  return 0;
}
