// 2009アジア地区予選 D : Separate Points
#include <iostream>
#include <fstream>
#include <complex>
#include <vector>
#include <algorithm>

using namespace std;

const double EPS = 1e-8;

typedef complex<double> P;

struct L { P p, q; L(P p, P q) : p(p), q(q) {} };

double dot(P a, P b){ return real(conj(a)*b); }
double cross(P a, P b){ return imag(conj(a)*b); }
double angle(P a, P b){ return arg(conj(a)*b); }

bool compare(const P &a, const P &b){
	return make_pair(real(a),imag(a)) < make_pair(real(b),imag(b));
}

vector<P> convexHull(vector<P> vp){
	if(vp.size() < 3) return vp;
	sort(vp.begin(), vp.end(), compare);
	vector< pair<double,int> > vi;
	for(int i=1;i<vp.size();i++) vi.push_back(make_pair(angle(P(1,0),vp[i]-vp[0]), i));
	sort(vi.begin(), vi.end());
	vector<P> res(2);
	res[0] = vp[0]; res[1] = vp[vi[0].second];
	for(int i=1;i<vi.size();i++){
		P next = vp[vi[i].second];
		int sz = res.size();
		while(sz>=2&&cross(res[sz-1]-res[sz-2],next-res[sz-1])<EPS){
			res.pop_back(); sz--;
		}
		res.push_back(next);
	}
	return res;
}

bool ssIntersect(L a, L b){
	if(imag((a.q-a.p)/(b.q-b.p))<EPS) return false;
	return cross(a.q-a.p,b.p-a.p)*cross(a.q-a.p,b.q-a.p)<EPS&&
		   cross(b.q-b.p,a.p-b.p)*cross(b.q-b.p,a.q-b.p)<EPS;
}

bool contain(vector<P> vp, P p){
	if(vp.size()==1) return false;
	bool in = false;
	for(int i=0;i<vp.size();i++){
		P a = vp[i]-p, b = vp[(i+1)%vp.size()]-p;
		if(imag(a) > imag(b)) swap(a,b);
		if(imag(a) < EPS && EPS < imag(b))
			if(cross(a,b) < 0) in = !in;
		if(abs(cross(a,b))<EPS&&dot(a,b)<EPS) return true;
	}
	return in;
}

bool separate(vector<P> a, vector<P> b){
	if(a.size()!=1&&b.size()!=1)
		for(int i=0;i<a.size();i++)
			for(int j=0;j<b.size();j++)
				if(ssIntersect(L(a[i],a[(i+1)%a.size()]),L(b[j],b[(j+1)%b.size()]))) return false;
	for(int i=0;i<a.size();i++)
		if(contain(b, a[i])) return false;
	for(int i=0;i<b.size();i++)
		if(contain(a, b[i])) return false;
	return true;
}

int main(){
	ifstream fin("D.in");
	int n, m;
	while(fin >> n >> m, n){
		int x, y;
		vector<P> black, white;
		for(int i=0;i<n;i++){ fin >> x >> y; black.push_back(P(x,y)); }
		for(int i=0;i<m;i++){ fin >> x >> y; white.push_back(P(x,y)); }
		cout << (separate(convexHull(black), convexHull(white)) ? "YES" : "NO") << endl;
	}
}