Berlanders 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.
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*<sub class="lower-index">*x*</sub>, *M*<sub class="lower-index">*y*</sub> ( - 10<sup class="upper-index">4</sup> ≤ *M*<sub class="lower-index">*x*</sub>, *M*<sub class="lower-index">*y*</sub> ≤ 10<sup class="upper-index">4</sup>), coordinates of Misha's trade points.

The next *m* lines contains pairs of space-separated integers *S*<sub class="lower-index">*x*</sub>, *S*<sub class="lower-index">*y*</sub> ( - 10<sup class="upper-index">4</sup> ≤ *S*<sub class="lower-index">*x*</sub>, *S*<sub class="lower-index">*y*</sub> ≤ 10<sup class="upper-index">4</sup>), coordinates of Sasha's trade points.

It is guaranteed that all *n* + *m* points are distinct.
def way_cut(x1,y1,x2,y2):
    return (((x1-x2)**2+(y1-y2)**2)**0.5)
n, m = map(int,input().split())
ni = [list(map(int,input().split())) for i in range(n)]
mi = [list(map(int,input().split())) for i in range(m)]
x = 0
y = 0
for i in range(n):
    x += ni[i][0]
    y += ni[i][1]
x = x / float(n)
y = y / float(n)
way = -1.0
for i in range(n):
    way = max(way,way_cut(x,y,ni[i][0],ni[i][1]))
error = 0
for i in range(m):
    if way >= way_cut(x,y,mi[i][0],mi[i][1]):
        error = 1
if error == 1:
    x = 0
    y = 0
    for i in range(m):
        x += mi[i][0]
        y += mi[i][1]
    x = x / float(m)
    y = y / float(m)
    way = -1.0
    for i in range(m):
        way = max(way,way_cut(x,y,mi[i][0],mi[i][1]))
    error = 0
    for i in range(n):
        if way >= way_cut(x,y,ni[i][0],ni[i][1]):
            error = 1
    if error == 1:
        print("NO")
    else:
        print("YES")
else:
    print("YES")
