You are given four integers sx, sy, fx, and fy, representing the starting coordinate (sx, sy) and the target coordinate (fx, fy) on an infinite two-dimensional grid. You are also given a non-negative integer t.

Each second, you must move to any of the $8$ adjacent cells (horizontally, vertically, or diagonally).

Return true if you can reach the target coordinate (fx, fy) in exactly t seconds, and false otherwise.

Constraints:

• $1 \leq$ sx, sy, fx, fy $\leq 10^9$

• $0 \leq$ t $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.