A rectangular publicity panel contains bulbs organized in rows and columns.

Each row and each column have a switch, which changes the status of every bulb from its initial state into the contrary state (on/off, off/on). You can not switch bulbs one by one. Initially, the panel has all the bulbs off.

Write a program that transforms the panel from the original configuration to a given configuration, switching a minimum number of rows and columns, if that is possible.

The input file BECURI.IN contains:

• On the first line two integer numbers, m and n, separated by a space character, representing the number of rows and columns;
• On the each of the next m lines, there are n columns, made of 0 or 1 elements, separated by space characters, representing the final configuration of the panel. 1 is the code of an on bulb and 0 the code of an off bulb.

A solution will be printed in the output file BECURI.OUT:

• On the first line of the input file the index of the columns switched, separated by space characters;
• On the second line the index of the rows switched, separated by space characters.

If the row or column is not switched, print 0 on the corresponding line.

The numbering of the lines and columns starts from 1.

If the problem has no solutions, print on the first line of the file –1.

• m <=100, n <=100

BECURI.IN		BECURI.OUT
5 6 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 0 1 0 0 1 0 0 1 0 0 1 0		2 5 1 2 3