Can someone point out the error in this code -> PROBLEM
I am assuming there's something wrong with my binary search.
This is the implementation I normally use. In case if someone could suggest something better.

And also if someone can give me a link to the blogs explaining different implementation's of binary search, it would be very helpful. I think there were some blogs regarding this topic. I can't remember properly during round Div. 2 (703).

Just a small doubt regarding this problem.

Can anyone tell me why we are choosing m moves from a total of (n+m) moves to reach coordinate (x, y)?