amazon sde dynamicprogramming question (k jumps)

if you are in (x,y). you can go to (x+i,y+j) grid where i+j>0(any posible i value ,j value .
you want go to (m,n) from(0,0) in exactly k jumps.return no of different ways to reach the last grid(m,n)
TESTCASE1 :m=2
n=2
k=2
OUTPUT:7 ways
explanation :
(0,0)->(1,1)->(2,2)
(0,0)->(1,2)->(2,2)
(0,0)->(2,1)->(2,2).............so on
TESTCASE2:m=4n=5
k=22
OUTPUT:0
you cannot move by exactly k jumps .
important to note:(optimisation is necessary can any one solve)
CONSTRAINTS:0<m<200
0<n<200
0<k<200