Find Minimum Jumps to reach ( M , N ) from ( 1, 1 ). If you are at ( X , Y ), then you can go to either ( X + Y , Y) or ( X , X + Y ). If it's not possible to reach ( M , N ), then return -1.
M = 3, N = 2
output = 2
M = 2, N = 2
output = -1