GPS For Autonomous Driving

Problem Statement

GPS For Autonomous Driving Description Your task is to create a navigation program for an autonomous car. The car is currently in development and has its drawbacks. The car can make no more than two turns on its way from the starting point to the finish point. The testing center is a grid of b rows and p columns. Find a way from the starting point to the finish point that has no more than two turns and does not contain cells with blockages, or determine that it is impossible to drive to the end. The car can only move upwards, downwards, to the left, and the right. Input The first line of input contains an integer b (number of rows). The second line of input contains an integer p (number of columns). The next b lines of input contain p space-separated characters, representing the grid. These characters are allowed to appear: 'o' - an empty cell 'x' - a cell with road blockages 'Q' - the starting point 'W' - the ending point "Q" and "W" will appear only once . Output Print "DRIVE!" (with