Given a map, where 'P' is the start point, '.' represents the positions to be visited, and 'X' represents obstacles. Given a series of directions and number of steps to take in that direction, e.g., ["U 5", "D 2", "L 3", "R 3"]. Decide after following the instruction to drive from the starting point, if all the desired positions represented in '.' can be visited.
