# Byang and The Grid Game

Back with a Byang!
Limits 2s, 512 MB

Byang has invented a game he wants to play with his soulmate Byangette during their spare time.

The rules are simple. You are given an infinite 2D grid, an initial position on the grid ($x_0$, $y_0$), a list of $P$ other distinct cells of the form ($x_i$, $y_i$), and a list of $K$ moves of the form ($dx_i$, $dy_i$).

There are P coins: one in each of the given cells (let's call them 'coin cells'). You have to collect all of them in the order they were given to win the game. ($x_0$, $y_0$) represents the $y_0$-th column of the $x_0$-th row and this is where the game begins. If you are at the $(px, py)$-th cell and you make the move #i [which is represented by $(dx_i, dy_i)$], your next position will be $(px+dx_i, py+dy_i)$.

You can use only one of the given $K$ moves to go from a coin cell (or, the first cell) to the next coin cell and you can use that move as many time as you want to reach the coin cell. You can change the move you are using once you get to that next coin cell. You can use the same move multiple times in order to reach different coin cells. (Look at the sample cases for a detailed explanation.)

Byang does not want to disappoint Byangette. So he wants to check whether Byangette can collect all the coins while conforming to all the rules mentioned above. As his dear friend and a good programmer, you are here to help him get the job done.

## Input

The first line of input will have 4 integers: $P$ ($0 \le P \le 10_5$), $K$ ($1 \le K \le 10_3$), $x_0$, $y_0$.

The next $P$ lines will contain the locations of the $P$ coin cells. Each of the lines will have 2 integers: $x_i$, $y_i$. ($-10^9 \le x_i$, $y_i \le 10^9$, $1 \le i \le P$)

The following $K$ lines will contain the list of moves one can make during the game. Each of the lines will contain 2 integers: $dx_i$, $dy_i$. ($-10^9 \le dx_i$, $dy_i \le 10^9$, $1 \le i \le K$)

It is guaranteed that the starting cell and the coin cells are all distinct.

## Output

The first and only line of output will contain the word “Yes” (without the quotation marks) if you can collect all the $P$ coins while conforming to the game rules, or “No” (without the quotation marks) otherwise.

## Sample

InputOutput
1 2 0 0
3 3
5 4
-2 -1


No


You cannot get to cell (3,3) from cell (0,0) using only one of the given moves. Notice that it would have been possible if you were allowed to use multiple type of moves from the move list. Thus, the answer is “No”.

### Statistics

40% Solution Ratio
moinul.shaonEarliest, Dec '15
arefinnomiFastest, 0.0s
arefinnomiLightest, 0 B
habijabiShortest, 1062B