The Table#1393
Consider a table with rows and columns filled with 32-bit signed integers. The columns are numbered from to , starting from the left side of the table.
Let A_i (1 \leq i \leq m) be the product of all numbers in the -th column. Find the maximum among these products and output the number of the column where the maximum product is achieved. If there are multiple such columns, output the largest column number among them.
The input consists of multiple test cases. Each test case begins with a line containing two integers and (1 \leq m \leq 20, 1 \leq n \leq 1000). Each of the next lines contains integers, representing 32-bit signed integers.
For each test case, output on a separate line the column number with the maximum product. If there are several such columns, output the largest column number among them.
Example 1