PROGRAMMING:Treasure hunt route

In a square matrix with M rows and N columns, there are treasures with different values (positive or negative values) in each square. What makes Xiaoming curious is that in all possible routes from the upper left corner to the lower right corner, what is the maximum total value of the treasures? And this route to the maximum
How many【 Note: you can only walk down or right from one grid to the adjacent grid, and the baby in the grid will be picked up
###Input format:
The first line is integers m and n (all not greater than 100). At the beginning of the next line, there will be an integer square matrix with M rows and N columns, corresponding to the precious values in the square matrix (the absolute values of these values are not more than 500).
###Output format:
Output 2 integers in a single line, which are the maximum value of the sum of the value of the baby and the number of routes reaching the maximum value, with a space between the 2 integers.
###Input example:
Here is a set of inputs. For example:
```in
4 5
2 -1 6 -2 9
-3 2 5 -5 1
5 8 3 -2 4
5 2 8 -4 7
```
###Output example:
The corresponding output is:
```out
26 3
```







answer：If there is no answer, please comment