On a two-dimensional plane, Takahashi is initially at point $(0, 0)$, and his initial health is $H$. $M$ items to recover health are placed on the plane; the $i$\-th of them is placed at $(x_i,y_i)$.
Takahashi will make $N$ moves. The $i$\-th move is as follows.
1. Let $(x,y)$ be his current coordinates. He consumes a health of $1$ to move to the following point, depending on $S_i$, the $i$\-th character of $S$:
* $(x+1,y)$ if $S_i$ is `R`;
* $(x-1,y)$ if $S_i$ is `L`;
* $(x,y+1)$ if $S_i$ is `U`;
* $(x,y-1)$ if $S_i$ is `D`.
2. If Takahashi's health has become negative, he collapses and stops moving. Otherwise, if an item is placed at the point he has moved to, and his health is strictly less than $K$, then he consumes the item there to make his health $K$.
Determine if Takahashi can complete the $N$ moves without being stunned.
## Constraints
* $1\leq N,M,H,K\leq 2\times 10^5$
* $S$ is a string of length $N$ consisting of `R`, `L`, `U`, and `D`.
* $|x_i|,|y_i| \leq 2\times 10^5$
* $(x_i, y_i)$ are pairwise distinct.
* All values in the input are integers, except for $S$.
## Input
The input is given from Standard Input in the following format:
$N$ $M$ $H$ $K$
$S$
$x_1$ $y_1$
$\vdots$
$x_M$ $y_M$
[samples]