Field of Wonders#7235
Stepan has reached the super final of the New Year's show "Field of Wonders." Unlike the usual games, this special edition is played on a rectangular grid divided into squares, rather than on a round drum.
Each square on the grid contains a number, which can be positive or negative. Stepan begins in the top-left corner of the grid and can move to one of three adjacent squares: right, down, or diagonally down-right (as shown in the illustration). His goal is to reach the bottom-right corner of the grid.
Stepan aims to win the game by accumulating the highest possible score. If his total score is positive, he wins; if not, he loses.
Write a program to help Stepan determine whether he will win or lose, and calculate the score he can achieve.
The first line of the input contains two integers , (1 \leq N \leq 100, 1 \leq M \leq 100), representing the dimensions of the game grid.
The following lines each contain integers, representing the values in the grid cells, with absolute values not exceeding .
The first line of the output should contain the word winner if Stepan wins the game, or loser if he does not.
The second line should display the total score achieved.
Example 1