This is an interactive optimization problem. Instead of having to find the best answer, each solution will get score according to its efficiency. As the problem is interactive, during the testing process, the jury program and your solution will exchange messages via standard input and output streams. After printing a message, remember to flush the output buffer to ensure that the message is fully sent. For example, you can use fflush(stdout) in C++, System.out.flush() in Java, flush(output) in Pascal, and stdout.flush() in Python. Your task is to automate the next generation taxi service, BuberPool. Each Buber car may transport up to four passengers at a time. The cars have to drive to passengers' locations, pick them up and drive them to their destinations. Additionally, unlike a traditional taxi, each car can process up to four orders simultaneously. For example, when driving a passenger to the destination, a car can pick up an additional passenger, or make a detour to drop off another passenger. We will use the following simplified discrete model for this real-life problem. Consider a city as a rectangular grid of (w) streets and (h) avenues with (w \times h) crossroads. The streets are numbered from (1) to (w), and the avenues from (1) to (h). We will consider non-negative integer moments of time. Actions are performed in ticks: intervals of time between consecutive moments. At any moment, each car is located at some crossroads ((x, y)), where (1 \le x \le w) and (1 \le y \le h). Any number of cars can be at the same crossroads simultaneously. During one tick, each car can either remain on the same crossroads or change exactly one of its coordinates, the street or the avenue, by one. At moment (0), you are given starting locations of (k) cars: ((x_1, y_1)), ((x_2, y_2)), (\ldots), ((x_k, y_k)). The number of cars is equal to (k) and does not change during the simulation. Additionally,