Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Sasha Circle

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputBerlanders like to eat cones after a hard day. Misha Square and Sasha Circle are local authorities of Berland. Each of them controls its points of cone trade. Misha has *n* points, Sasha — *m*. Since their subordinates constantly had conflicts with each other, they decided to build a fence in the form of a circle, so that the points of trade of one businessman are strictly inside a circle, and points of the other one are strictly outside. It doesn't matter which of the two gentlemen will have his trade points inside the circle.

Determine whether they can build a fence or not.

Input

The first line contains two integers *n* and *m* (1 ≤ *n*, *m* ≤ 10000), numbers of Misha's and Sasha's trade points respectively.

The next *n* lines contains pairs of space-separated integers *M*_{x}, *M*_{y} ( - 10^{4} ≤ *M*_{x}, *M*_{y} ≤ 10^{4}), coordinates of Misha's trade points.

The next *m* lines contains pairs of space-separated integers *S*_{x}, *S*_{y} ( - 10^{4} ≤ *S*_{x}, *S*_{y} ≤ 10^{4}), coordinates of Sasha's trade points.

It is guaranteed that all *n* + *m* points are distinct.

Output

The only output line should contain either word "YES" without quotes in case it is possible to build a such fence or word "NO" in the other case.

Examples

Input

2 2

-1 0

1 0

0 -1

0 1

Output

NO

Input

4 4

1 0

0 1

-1 0

0 -1

1 1

-1 1

-1 -1

1 -1

Output

YES

Note

In the first sample there is no possibility to separate points, because any circle that contains both points ( - 1, 0), (1, 0) also contains at least one point from the set (0, - 1), (0, 1), and vice-versa: any circle that contains both points (0, - 1), (0, 1) also contains at least one point from the set ( - 1, 0), (1, 0)

In the second sample one of the possible solution is shown below. Misha's points are marked with red colour and Sasha's are marked with blue.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/03/2020 13:14:15 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|