n spaceships have been sent to the third planet from the Sun to collect various objects for study. Each ship carried
m containers of various sizes. After studying the planet,
n·m instances were selected. The command staff decided to take several copies of the largest volume. It is necessary to determine what volume the largest instance must have so that it can be taken out of the planet, as well as the number of ships and their numbers on which the largest instances can be placed. All ships are numbered starting from zero.
Input
The first line contains two integers
n and
m:
n is the number of ships sent to the third planet (1 <= n <= 100 ),
m - the number of containers on each ship. The following
n lines contain
m numbers, each of which shows the volume of the container (1 <= m <= 100, each number is non-negative no more than 100).
Imprint
Print in the first line - the number of spaceships that can bring the largest copy, separated by a space - the maximum amount that can be taken from the planet. On the next line print space-separated numbers of ships (numbered from zero) on which the largest copy can be loaded.
Examples
| # |
Input |
Output |
| 1 |
3 3
1 2 3
3 5 4
5 2 2
|
25
1 2
|