TRIKA  Training for final
Abotrika is a famous player who plays in a good team. His team is going to play the final match next week and he have to train hard because all his fans are expecting that Abotrika will score more than one goal, so his teammates suggested helping him in training given that Abotrika will play alone against all his friends in the training.
Input
Given two integers N,M (length and width of the training court) 2 <= N, M <= 20 and X,Y the starting point of Abotrika on the court where X is number of row and Y is number of column 1 <= X <= N, 1 <= Y <= M then P[i][j], where P is the power of each of his friends 0 < P[i][j] <100, and P[X][Y] is the power of Abotrika.
Output
The output must be one line either "N" or "Y" then the maximum power "Abotrika can get when he pass from his friends to reach the (the goal who is at the cell P[N][M] in the court ).
NOTE: Abotrika's power decreases by the power of his teammate whom Aboutrika succeeded to get through on his way to score a goal. "Y" means that he had scored a goal with power at least 0 and "N" if he couldn't reach the goal with zero power at least. Also, Abotrika can only move in two directions  right and down  to reach the goal.
Example
Input: 4 4 1 1 100 55 10 2 20 10 90 1 60 20 22 4 1 30 70 5 Output: Y 23
Explanation: The maximum power Abotrika can get after reaching goal : 100  (55+10+2+1+4+5) = 23
Input: 2 2 1 1 1 55 20 10 Output: N
Explanation: The maximum power Abotrika can get after reaching goal : 1  (20+10) = 29 so it will be N.
hide comments
sagar_june97p:
20190611 13:48:42
AC in One go!!!


wytwalker:
20190509 14:59:55
Similar to "Robot and Paths" on Codechef. 

ajaytec227:
20180801 14:16:02
The remaining power can also be zero 

priyanshu_98:
20180616 10:35:03
AC in second go. Must for Dp learner! otherwise this same as "SHOP  Shopping". Last edit: 20180616 10:41:47 

tanmayak99:
20180603 07:54:58
Take care of cases where x=n or y=m.. cost me 2 WAs. Last edit: 20180603 07:55:12 

ameyanator:
20180330 18:12:42
Simple DP problem! AC in one go 

nadstratosfer:
20180319 20:29:47
One of these problems where the hardest part is making out WTF the question itself is. Translation for those struggling to decipher the statement:


vishesh_345:
20171228 11:17:09
This is a specific case (move right and down) of a question which is done by dijkstra.


rohit9934:
20170901 19:27:32
++149 

srevarun:
20170811 16:30:34
guys anyone know the 8th test case,i am getting WA in that Last edit: 20170811 16:30:51 
Added by:  Kawmia Institutes 
Date:  20100822 
Time limit:  0.107s0.215s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 BF 
Resource:  Own problem 