#include <stdlib.h>
#include <math.h>
#include <bits/stdc++.h>
#define MAXN 1000
using namespace std;
const double eps=1e-8;
struct Point{
	double x,y;
	Point(){}
	Point(int x,int y):x(x),y(y){}
	Point operator -(Point B){
		return Point(x-B.x,y-B.y);
	}
};

Point P[MAXN]; 
int relativeCCW(double x1, double y1,
                                  double x2, double y2,
                                  double px, double py)
    {
        x2 -= x1;
        y2 -= y1;
        px -= x1;
        py -= y1;
        double ccw = px * y2 - py * x2;
        if (ccw == 0.0) {
            ccw = px * x2 + py * y2;
            if (ccw > 0.0) {
                px -= x2;
                py -= y2;
                ccw = px * x2 + py * y2;
                if (ccw < 0.0) {
                    ccw = 0.0;
                }
            }
        }
        return (ccw < 0.0) ? -1 : ((ccw > 0.0) ? 1 : 0);
    }	

  bool linesIntersect(double x1, double y1,
                                         double x2, double y2,
                                         double x3, double y3,
                                         double x4, double y4)
    {
        return ((relativeCCW(x1, y1, x2, y2, x3, y3) *
                relativeCCW(x1, y1, x2, y2, x4, y4) <= 0)
                && (relativeCCW(x3, y3, x4, y4, x1, y1) *
                relativeCCW(x3, y3, x4, y4, x2, y2) <= 0));
    }

     

int main(){
	
	int n,m;
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for(int i = 1 ; i <=n ; i ++){
		Point p;
		cin >> p.x >> p.y;
		P[i] = p;
	}
	Point p;
	p.x=P[n].x;
	p.y=P[n].y;
	P[0]=p;
	
	for(int i = 1 ; i <=m ; i ++){
		Point p1,p2;
		cin >> p1.x >> p1.y>> p2.x >> p2.y;
		
		bool flag =false;
		for(int j=1;j<=n;j++){
			Point a=P[j-1];
			Point b=P[j];
		flag=linesIntersect(a.x,a.y,b.x,b.y,p1.x,p1.y,p2.x,p2.y);
			if(flag){
				break;
			}
		}
		if(flag){
			cout<<"YES"<<endl;
		}else{
			cout<<"NO"<<endl;
		}
	}
	return 0;
}