There is a grid like field which has holes in each hole there is certain amount of carrots denoted by **C**  \nGiven an **M** * **N** grid , **M row** , **N columns**. Now there is a rabbit at standing at position (i, j) in the grid . Rabbit wants to get as much as it can, but he can cross a row at most **x** number of times and columns at most **y** number of times and can move only in four directions left ,right, up and down by 1. Rabbit has to reach at position (i \' , j \' ) after taking carrots.Find the maximum number of carrots he can get.\n\n*crossing row or column means moving from one column to other or moving one row to other row .*\nIt is guaranteed that rabbit will reach destination.\n\n**Contraints**  \n 2 < M, N < 10^3\n 2 <X, Y<10^6\n\nInput :  \nM=4, N=4 \nfield = [[2,3,1,4], [2,0,0,2], [1,2,5,6],[3,4,2,1]]\nsource = [i, j] = [3,0]\ndestination = [i\', j\'] = [1,3]\nx=4 , y=3\nOutput :  25  \n\n\n\n\n

There is a grid like field which has holes in each hole there is certain amount of carrots denoted by C  \nGiven an M * N grid , M row , N columns. Now there is