#include <bits/stdc++.h>
using namespace std;
inline void setmin(int &x, int y) {
  if (y < x) x = y;
}
inline void setmax(int &x, int y) {
  if (y > x) x = y;
}
inline void setmin(long long &x, long long y) {
  if (y < x) x = y;
}
inline void setmax(long long &x, long long y) {
  if (y > x) x = y;
}
const int N = 100000;
const int inf = (int)1e9 + 1;
const long long big = (long long)1e18 + 1;
const int P = 239;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const double eps = 1e-9;
const double pi = atan2(0, -1);
const int ABC = 26;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.precision(20);
  cout << fixed;
  int n, m;
  cin >> n >> m;
  int a[n][m];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) cin >> a[i][j];
  int ans1[n], ans2[m];
  fill(ans1, ans1 + n, 0);
  fill(ans2, ans2 + m, 0);
  while (true) {
    int ccc = 0;
    for (int i = 0; i < n; i++) {
      int s = 0;
      for (int j = 0; j < m; j++) s += a[i][j];
      if (s < 0) {
        ccc++;
        ans1[i] ^= 1;
        for (int j = 0; j < m; j++) a[i][j] *= -1;
      }
    }
    for (int j = 0; j < m; j++) {
      int s = 0;
      for (int i = 0; i < n; i++) s += a[i][j];
      if (s < 0) {
        ccc++;
        ans2[j] ^= 1;
        for (int i = 0; i < n; i++) a[i][j] *= -1;
      }
    }
    if (ccc == 0) break;
  }
  int c1 = 0, c2 = 0;
  for (int i = 0; i < n; i++) c1 += ans1[i];
  for (int i = 0; i < m; i++) c2 += ans2[i];
  cout << c1 << " ";
  for (int i = 0; i < n; i++)
    if (ans1[i]) cout << i + 1 << " ";
  cout << "\n";
  cout << c2 << " ";
  for (int i = 0; i < m; i++)
    if (ans2[i]) cout << i + 1 << " ";
  cout << "\n";
  return 0;
}
