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.
a=input()
a=a.split()
menor=500000
mayor=0
menor1=500000
mayor1=0
for k in range (int(a[0])):
        b=input()
        b=b.split()
        c=(((int(b[0]))**2)+((int(b[1]))**2))**(1/2)
        if menor>c:
                menor=c
        if mayor<c:
                mayor=c
for k in range (int(a[1])):
        d=input()
        d=d.split()
        e=(((int(d[0]))**2)+((int(d[1]))**2))**(1/2)
        if menor1>e:
                menor1=e
        if mayor1<e:
                mayor1=e
if menor>mayor1 or menor1>mayor:
        print("YES")
else:
        print("NO")