#include <bits/stdc++.h> #define NAME "MATRIX" #define Professor \ freopen(NAME ".INP", "r", stdin); \ freopen(NAME ".OUT", "w", stdout); #define FOR(i, x, n) for (int i = x; i <= n; i++) #define long long long #define fast \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); using namespace std; const int N = 21; vector<int> RowRemove(N), ColumnRemove(N); int a[N][N], b[N][N], x[N], n, m, ans = 0; int candidates[N]; bool needRemoveC[N], needRemoveR[N]; void Test() { FOR(i, 1, n) needRemoveR[i] = 0; FOR(i, 1, m) needRemoveC[i] = 0; int d = 0; FOR(i, 1, n) { d = 0; FOR(j, 1, m) if (x[j] == 0) { d++; b[i][d] = a[i][j]; } else needRemoveC[j] = 1; } FOR(i, 1, n) { int l = 0; FOR(j, 1, d) if (b[i][j] == 1) { l++; candidates[i] = j; } if (l != 1) { needRemoveR[i] = 1; candidates[i] = -1; } } int cur = 0, dem = 0; FOR(i, 1, n) if (candidates[i] == cur + 1) { cur++; dem++; } else needRemoveR[i] = 1; if (ans <= dem) { RowRemove.clear(); ColumnRemove.clear(); ans = dem; FOR(i, 1, n) if (needRemoveR[i]) RowRemove.push_back(i); FOR(i, 1, m) if (needRemoveC[i]) ColumnRemove.push_back(i); } } void Try(int i) { FOR(j, 0, 1) { x[i] = j; if (i == m) Test(); else Try(i + 1); } } int main() { fast; cin >> n >> m; FOR(i, 1, n) FOR(j, 1, m) cin >> a[i][j]; Try(1); cout << ans << '\n'; for (auto i : RowRemove) cout << i << ' '; cout << '\n'; for (auto i : ColumnRemove) cout << i << ' '; return 0; }