A.Pirates of the Carribbean.

This problem requires us to think sequentially.

Let us state the facts : \ - We must go from the top left corner to the bottom right corner . \ - We can only move right or down. \

You may think that this question is dreadfully complicated as there are $$$2^{m+n-2}$$$ ways to go from the top left corner to the bottom right. If we were to check every possible path for the one with most treasures time taken by the program will be too much and we will clearly get TLE for larger m and n. textbf{dfd} $$$a=b$$$ a=b