Slingshot

You are given a $N \times M$ matrix $A$, filled with **distinct** numbers. You can start at any cell. If you are currently at cell $(x_1, y_1)$, then you can jump to any other cell $(x_2, y_2)$, if and only if the following two conditions are satisfied: - $A_{x_2, y_2} \gt A_{x_1, y_1}$ - Manhattan distance between $A_{x_2, y_2}$ and $A_{x_1, y_1}$ $ \gt S$. Formally, $|x_1 - x_2| + |y_1 - y_2|