Question

.
he city. There are P(U) parking
If Bob is in City(1) then he can travel to any City(i+x, i+y)
x > 0 and x - y OR
x = 0 and y> O OR
X>0 and y 0.
Can you tell Bob in how many different number of ways can he can park his car in P
ing from City(1,1) to City(N,M). This number can be very large, so calculate it modu
NOTE: Two ways are considered different if there is at-least one parking lot in the fi
econd set.
.
INPUT
The first line contains two space-separated integers N and M.
The next N lines each contain M numbers separated by a space,
Thejt" value in ith line denotes P(U) ie number of parking lots in Cityj).
OUTPUT
Print the number of different ways to park the car while travelling from City(1,1) to City
CONSTRAINTS​

Answer 1

Answer:

duFjkfzkfzztkgkzgkxggjxgjxjggjgixh tuff didi xxi Digg cocoa coock ch poochho ch gxgiititzgizotztz xo xx hhv ii Gucci gg oo oo xx xx ich ch cc ch xx hhv too k eeyooydodtydodto