maze question is difficult. I can't come up with a good way to solve it - the main difficulty that I am seeing is that equal coin can be taken. This will lead to DP solutions not being able to properly memo it, either top-down or bottom-up. I briefly looked through some google results on "non-decreasing path in a matrix" and it seems like a very difficult problem with no easy solution for the given constraint 1 <= N <= 1000, 1 <= M <= 1000. 1 <= coin <= 100000, player can start at **any** cell and end at **any** cell
