Reminder: in case of any technical issues, you can use the lightweight website
m1.codeforces.com,
m2.codeforces.com,
m3.codeforces.com.
×

Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. The table

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputHarry 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!

Input

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*_{i, j} (|*a*_{i, j}| ≤ 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*.

Output

In the first line print the number *a* — the number of required applications of the first spell. Next print *a* space-separated integers — the row numbers, you want to apply a spell. These row numbers must be distinct!

In the second line print the number *b* — the number of required applications of the second spell. Next print *b* space-separated integers — the column numbers, you want to apply a spell. These column numbers must be distinct!

If there are several solutions are allowed to print any of them.

Examples

Input

4 1

-1

-1

-1

-1

Output

4 1 2 3 4

0

Input

2 4

-1 -1 -1 2

1 1 1 1

Output

1 1

1 4

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/08/2020 19:01:05 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|