Harry Potter has a difficult homework. Given a rectangular table, consisting of *n* × *m* cells. Each cell of the table contains the integer. Harry knows how to use two spells: the first spell change the sign of the integers in the selected row, the second — in the selected column. Harry's task is to make non-negative the sum of the numbers in each row and each column using these spells.

Alone, the boy can not cope. Help the young magician!
The first line contains two integers *n* and *m* (1 ≤ *n*,  *m* ≤ 100) — the number of rows and the number of columns. 

Next *n* lines follow, each contains *m* integers: *j*-th integer in the *i*-th line is *a*<sub class="lower-index">*i*, *j*</sub> (|*a*<sub class="lower-index">*i*, *j*</sub>| ≤ 100), the number in the *i*-th row and *j*-th column of the table.

The rows of the table numbered from 1 to *n*. The columns of the table numbered from 1 to *m*.
import math
import sys
input = sys.stdin.readline
n, m = map(int, input().split())
a = [[] for _ in range(n)]
for i in range(n):
    a[i] = [int(_) for _ in input().split()]
row = []
col = []
rowStat = [1] * n
colStat = [1] * m
while True:
    bad = False
    for i in range(n):
        total = 0
        for j in range(m):
            total += a[i][j]
        if total < 0:
            bad = True
            rowStat[i] *= -1
            for j in range(m):
                a[i][j] *= -1
    for i in range(m):
        total = 0
        for j in range(n):
            total += a[j][i]
        if total < 0:
            bad = True
            colStat[i] *= -1
            for j in range(n):
                a[j][i] *= -1
    if not bad:
        break
for i in range(n):
    if rowStat[i] == -1:
        row.append(i + 1)
for i in range(m):
    if colStat[i] == -1:
        col.append(i + 1)
print(len(row), ' '.join(map(str, row)))
print(len(col), ' '.join(map(str, col)))
