Drone Control

A drone starts at the origin of the coordinate plane. You can enter four kinds of commands.

• U: increases the $y$ coordinate of the drone by $1$.
• D: decreases the $y$ coordinate of the drone by $1$.
• R: increases the $x$ coordinate of the drone by $1$.
• L: decreases the $x$ coordinate of the drone by $1$.

There are also $N$ obstacles on the plane. If the cell that the drone tries to move into contains an obstacle, the drone does not move and stays where it is. Given the obstacle positions and the entered commands, find the final position of the drone.

The first line contains two integers $N$ and $K$, the number of obstacles and the number of commands, separated by a space. ($1 \leq N, K \leq 500$)

The next $N$ lines each contain two integers $x_i$ and $y_i$, the coordinates of the $i$-th obstacle, separated by a space. All obstacle positions are distinct, and there is no obstacle at the origin. ($-500 \leq x_i, y_i \leq 500$)

The $(N+2)$-th line is a string of the entered commands. Each character of the string is one of U, D, R, or L.

After all commands are entered, print the $x$ coordinate and the $y$ coordinate of the drone's position, separated by a space.