Maximum Carrots Path

Problem Statement

Maximum Carrots Path Problem Description A field, represented as cells of an M X N matrix, is given. There are some carrots available on the way. A rabbit starts from the top-left cell, and moves right or down in each step, and finally reaches the bottom-right cell. Write a program to find the maximum number of carrots the rabbit can eat during the trip from the top-left cell to the bottom-right cell. Note that the Rabbit always moves either to downfield or right field, and always consumes all the carrots available in the cells on its path. Read the input from STDIN and print the output to STDOUT. Do not print arbitrary strings anywhere in the program, as these contribute to the output and test cases will fail. Constraints M, N >= 2 Input Format The first line of input contains two integers M and N separated by a single white space, where M and N represent the size of the field. Next M lines have N integers, separated by a single white space, which represents the number of carrots in e