Inputs:

| O | E | E | E | X |
| E | O | X | X | X |
| E | E | E | E | E |
| X | E | O | E | E |
| X | E | X | E | X |

Location Map: A 2D grid where:

'O' represents a robot
'E' represents an empty space
'X' represents a blocker
Query Array: [2, 2, 4, 1]

These values represent the exact distances a robot must be able to move before hitting a blocker:
Left: 2 spaces
Top: 2 spaces
Bottom: 4 spaces
Right: 1 space

Notes:
The boundaries of the map are also considered blockers. Need to find all robot positions that satisfy these exact distance requirements in all four directions

Task:
Return the coordinates of all robots that meet these movement constraints.