#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
inline long long int GCD(long long int x, long long int y) {
  if (x < y) swap(x, y);
  if (x == 0) return y;
  if (y == 0) return x;
  return GCD(x % y, y);
}
long long int phi(long long int n) {
  long long int result = n;
  for (long long int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      while (n % i == 0) n /= i;
      result -= result / i;
    }
  }
  if (n > 1) result -= result / n;
  return result;
}
long long int power(long long int x, long long int n, long long int mod) {
  long long int res = 1;
  x %= mod;
  while (n) {
    if (n & 1) {
      res = ((res * x) % mod + mod) % mod;
    }
    x = ((x * x) % mod + mod) % mod;
    n >>= 1;
  }
  return res;
}
long long int A[105][105];
long long int row[105], col[105], fr[105] = {0}, fc[105] = {0}, cr = 0, cc = 0;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int n, m;
  cin >> n >> m;
  for (long long int i = 1; i <= n; i++) {
    for (long long int j = 1; j <= m; j++) {
      cin >> A[i][j];
      row[i] += A[i][j];
      col[j] += A[i][j];
    }
  }
  while (1) {
    bool f = true;
    for (long long int i = 1; i <= n; i++) {
      if (row[i] < 0) {
        f = false;
        fr[i] ^= 1;
        cr--;
        if (fr[i]) cr += 2;
        for (long long int j = 1; j <= m; j++) {
          row[i] -= (2 * A[i][j]);
          col[j] -= (2 * A[i][j]);
          A[i][j] = -A[i][j];
        }
      }
    }
    for (long long int j = 1; j <= m; j++) {
      if (col[j] < 0) {
        f = false;
        fc[j] ^= 1;
        cc--;
        if (fc[j]) cc += 2;
        for (long long int i = 1; i <= n; i++) {
          row[i] -= (2 * A[i][j]);
          col[j] -= (2 * A[i][j]);
          A[i][j] = -A[i][j];
        }
      }
    }
    if (f) break;
  }
  cout << cr << " ";
  for (long long int i = 1; i <= n; i++) {
    if (fr[i]) cout << i << " ";
  }
  cout << endl;
  cout << cc << " ";
  for (long long int j = 1; j <= m; j++) {
    if (fc[j]) cout << j << " ";
  }
  cout << endl;
}
