#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int n, m;
int a[111][111];
int rs[111], cs[111];
int r[111];
int c[111];
vector<int> rr, cc;
void solve() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) gn(a[i][j]);
  }
  while (1) {
    memset(rs, 0, sizeof rs);
    memset(cs, 0, sizeof cs);
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) rs[i] += a[i][j], cs[j] += a[i][j];
    }
    int cnt = 0;
    for (int i = 0; i < n; i++)
      if (rs[i] < 0) {
        cnt++;
        for (int j = 0; j < m; j++) a[i][j] = -a[i][j];
        r[i] ^= 1;
      }
    if (cnt) continue;
    for (int i = 0; i < m; i++)
      if (cs[i] < 0) {
        cnt++;
        for (int j = 0; j < n; j++) a[j][i] = -a[j][i];
        c[i] ^= 1;
      }
    if (cnt == 0) break;
  }
  for (int i = 0; i < n; i++)
    if (r[i]) rr.push_back(i + 1);
  for (int i = 0; i < m; i++)
    if (c[i]) cc.push_back(i + 1);
  println(((int)rr.size()));
  for (int u : rr) println(u);
  println(((int)cc.size()));
  for (int u : cc) println(u);
}
int main() {
  solve();
  return 0;
}
