favorite We need a little bit of your help to keep things running, click on this banner to learn more

Baku - Preparation for 1/4 ACM ICPC

Lucky Chances

Lucky Chances is a lottery game. Each lottery ticket has a play field and a scratch area. The play field is a rectangular r × c field filled with numbers. The scratch area hides row and column numbers that specify the bet cell.

There are four possible winning directions: up, down, left and right. You win a direction if all numbers in this direction from the bet cell are strictly less than a number in the bet cell. And if the bet cell is on the edge of the grid, you win the corresponding direction automatically!


Larry wants to choose the ticket that has maximum total number of winning directions for all possible bet cells. Write a program that determines this number for the given grid.


The first line contains two integers r and c (1r, c100) - the number of rows and columns in the grid.

The following r lines contain c integers each - the numbers printed on the grid. Each number is positive and does not exceed 1000.


Output a single integer w - the total number of winning directions for the given grid.

Time limit 1 second
Memory limit 64 MiB
Input example #1
3 4
5 3 9 10
1 8 8 2
4 3 4 3
Output example #1
Source 2015 ACM NEERC, Northern Subregion, October 24, Problem L